Triangle Collection

Given a node-colored graph $G$ , is it true that for every triplet of colors $a$ , $b$ , $c$ there exists a triangle $(u, v, w)$ in $G$ where $u$ has color $a$ , $v$ has color $b$ and $w$ has color $c$

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 3 of 3 reductions


Triangle Collection	Triangle Collection*	2022
Triangle Collection*	Triangle Collection	2015
Triangle Collection	All-Color-Pairs Triangle Collection

Other relevant algorithms

Insuffient Data to display table