Cacetta conjecture. If every vertex of an $n$-vertex directed graph has at least $n/3$ edges leaving, then the graph has a directed triangle.
You can explain this even to a non-mathematician with a few pictures.
|
1 | [made Community Wiki] | ||
|
|
||||
