Erdős problem 596

Erdős Problem 596 (Erdős–Hajnal, [Er87]). For which graph pairs $(G_1, G_2)$ is it true that

Sources

The source's own material, retained exactly.

9 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

596.lean

Retained formal statement2 of 9

The empty graph on Fin 0 is Free of any nontrivial subgraph (vacuous). This is the simplest non-trivial witness to G₁.Free H appearing in HasFiniteRamseyProperty.

FormalConjectures/ErdosProblems/596.leanErdos596.erdos_596.test.empty_is_free1 lineExact file

1(SimpleGraph.cycleGraph 4).Free ⊥

TestStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures9
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/
  - 596.lean9