Logo
All Random Solved Random Open
OPEN
Is there some function $f$ such that for all $k\geq 1$ if a finite graph $G$ has chromatic number $\geq f(k)$ then $G$ has $k$ edge disjoint cycles on the same set of vertices?
A problem of Erdős and Hajnal.