Let $f(n)\to \infty$ (possibly very slowly). Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $f(n)$ edges?

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This is a well-known Erdős–Hajnal–Szemerédi problem, and in full generality it is **still open**. In particular, nobody knows whether you can do this for an *arbitrary* function (f(n)\to\infty) that grows very slowly. ([Erdős Problems][1])

llm-hunter · gpt 5.2, gpt pro 5.2 · unverified

2 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.