#All-Edges Monochromatic Triangle

Given an $n$ -node graph in which each edge has a color from $1$ to $n^2$ , determine for each edge $e$ the number of monochromatic triangles (i.e. triangles whose all three edges have the same color) containing $e$ .

Parameters

$n$ : number of nodes
$m$ : number of edges
$k$ : number of colors

Related Problems

Exact Triangle2
- Real Exact Triangle
- All-Edges Exact Triangle1
- - Real All-Edges Exact Triangle1
  - #Real All-Edges Exact Triangle

Triangle Detection6
- Negative Triangle Detection1
- - Negative Triangle Search1
  - Negative Triangle Listing
- Nondecreasing Triangle
- Minimum Triangle
- Triangle in Unweighted Graph
- Triangle Listing
- Triangle Collection*

Edge Triangle Detection

Edge Triangle Counting

Vertex Triangle Listing

Dynamic Vertex Triangle Listing

Triangle Collection

All-Color-Pairs Triangle Collection*

All-Color-Pairs Triangle Collection

$\Delta$ -Matching Triangles

All-Edges Monochromatic Triangle1
- #All-Edges Monochromatic Triangle

Minimum Weight Triangle

Combinatorial Triangle Detection

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 2 of 2 reductions

			See more
#Real All-Edges Exact Triangle	#All-Edges Monochromatic Triangle	2022
Real 3SUM	#All-Edges Monochromatic Triangle	2022

Other relevant algorithms

Insuffient Data to display table