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

The pair $(C_4, C_6)$ is Erdős–Hajnal exceptional; combines C4_C6_finite_ramsey and C4_free_countable_escape.

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

1(SimpleGraph.cycleGraph 4).IsErdosHajnalExceptional (SimpleGraph.cycleGraph 6)

SolvedStatement only, no proof