Erdős problem 617
Let . If the edges of are -coloured then there exist vertices with at least one colour missing on the edges of the induced .
Sources
FormalConjectures/ErdosProblems/
617.lean
Retained formal statement
Erdős and Gyárfás [ErGy99] showed this property fails for infinitely many if we replace by .
{r | ∃ V x x_1, Fintype.card V = r ^ 2 ∧ ∃ coloring, ∀ (S : Finset V), S.card = r + 1 → ∀ (k : Fin r), ∃ u ∈ S, ∃ v ∈ S, u ≠ v ∧ coloring s(u, v) = k}.InfiniteSolvedStatement only, no proof