Erdős problem 74

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?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

74.lean

Retained formal statement2 of 4

Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $\sqrt{n}$ edges?

FormalConjectures/ErdosProblems/74.leanErdos74.erdos_74.variants.sqrt1 lineExact file

1True ↔ ∃ V G, G.chromaticNumber = ⊤ ∧ ∀ (n : ℕ), ↑(Erdos74.SimpleGraph.maxSubgraphEdgeDistToBipartite G n) ≤ √↑n

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures4
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs0
not observed here
Erdős AI contributions wiki0
not observed here
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 74.lean4