Is it true that, for every $k$ , there is some $f (k)$ such that if $G$ has chromatic number $\geq f (k)$ then $G$ contains a triangle-free subgraph with chromatic number $\geq k$ ?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved