ErdosProblems · research open · AMS 5
unsolvedsorry — nobody on it
Erdős Problem 617
Conjecture 617 · Erdős
Let . If the edges of are -coloured then there exist vertices with at least one colour missing on the edges of the induced .
In other words, there is no balanced colouring.
A conjecture of Erdős and Gyárfás [ErGy99].
Formal statement · Lean 4.lean
theorem erdos_617 (r : ℕ) (hr : r ≥ 3) {V : Type} [Fintype V] [DecidableEq V]
(hV : Fintype.card V = r^2 + 1) (coloring : Sym2 V → Fin r) :
∃ (S : Finset V) (k : Fin r),
S.card = r + 1 ∧
∀ u ∈ S, ∀ v ∈ S, u ≠ v → coloring s(u, v) ≠ k := by
sorryProof. sorry
Nobody has tried yet.