Erdős Problem #640
Statement
Is there some function such that for all if a finite graph has chromatic number then must contain some odd cycle whose vertices span a graph of chromatic number ? ", "difficulty": "L1" },{
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.