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

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

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

1(SimpleGraph.completeGraph (Fin 4)).HasFiniteRamseyProperty (SimpleGraph.completeGraph (Fin 3))

SolvedStatement only, no proof

Sources

Search problems.science