Erdős problem 596 · problems.science

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

Sources

Browse retained paths and inspect the exact material available for this Problem.

9 retained statements2415f78e850a

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

Sources

Search problems.science