Erdős Problem #1091
Statement
Let be a -free graph with chromatic number . Must contain an odd cycle with at least two diagonals? More generally, is there some such that every graph with chromatic number , in which every subgraph on vertices has chromatic number , contains an odd cycle with at least diagonals?
Record
- Source
- Added
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.