Let $G$ be a graph with chromatic number $χ (G) = 4$ . If $m_{1} < m_{2} < \dots$ are the lengths of the cycles in $G$ then can $min (m_{i + 1} - m_{i})$ be arbitrarily large? Can this happen if the girth of $G$ is large?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved