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

Nešetřil–Rödl [NeRo75]: for every $n \geq 1$ there is a $C_4$ -free graph whose edges cannot be $n$ -coloured without a monochromatic $C_6$ .

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

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

SolvedStatement only, no proof