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] proved the conjecture for .
∀ r ≥ 3, ∀ {V : Type} [inst : Fintype V] [DecidableEq V], Fintype.card V = 4 ^ 2 + 1 → ∀ (coloring : Sym2 V → Fin 4), ∃ S k, S.card = 4 + 1 ∧ ∀ u ∈ S, ∀ v ∈ S, u ≠ v → coloring s(u, v) ≠ kSolvedStatement only, no proof