Problem 74

Erdős Problem #74: declared status 'open'. Formalized: yes. 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? Prize: $500. Tags: chromatic number, cycles, graph theory.