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 statement6 of 9

Erdős–Hajnal exceptional pairs exist — recorded as a known direction of erdos_596.

FormalConjectures/ErdosProblems/596.leanErdos596.erdos_596.variants.exists_exceptional1 lineExact file

1∃ U₁ U₂ G₁ G₂, G₁.IsErdosHajnalExceptional G₂

SolvedStatement only, no proof