Erdős Problem #74: locally almost bipartite graphs of infinite chromatic number
Statement
Erdős, Hajnal and Szemerédi asked whether, for every function , however slowly, there exists a graph of infinite chromatic number such that every finite -vertex subgraph can be made bipartite by deleting at most edges.
The answer is no: there exists a function such that every graph for which every finite -vertex subgraph is within edge deletions of bipartite has finite chromatic number.
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.