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?

unreviewedOpen. Worked here; no verified result yet.

graph theory · disproved · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

Connections1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Search Vela