Erdős Problem #594 — Odd Cycles in Graphs of Uncountable Chromatic Number
Statement
Does every graph with chromatic number at least contain all sufficiently large odd cycles? Equivalently, for every vertex type and every simple graph on , if has no proper coloring with the countable set of colors , then there exists such that for every with , there are a vertex and a cycle of based at whose length is .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.