ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Erdős, Hajnal and Szemerédi asked whether, for every function f(n)→∞f(n)\to\infty, however slowly, there exists a graph of infinite chromatic number such that every finite nn-vertex subgraph can be made bipartite by deleting at most f(n)f(n) edges.

The answer is no: there exists a function f(n)→∞f(n)\to\infty such that every graph for which every finite nn-vertex subgraph is within f(n)f(n) edge deletions of bipartite has finite chromatic number.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.