Corpus.Erdos617.erdos_617
Let $r\geq 3$.
formal-conjectures · erdos-problems · ams-5
Let $r\geq 3$. If the edges of $K_{r^2+1}$ are $r$-coloured then there exist $r+1$ vertices with at
least one colour missing on the edges of the induced $K_{r+1}$.
In other words, there is no balanced colouring.
A conjecture of Erdős and Gyárfás [ErGy99].
Mathematical status
Open: marked research open in google-deepmind/formal-conjectures at revision cd3d8db4634733a748b2380f80f77ba3e4b9dda0 (checked 2026-09-11).
Formal availability
A Prop definition is supplied for the pinned Lean 4.33.1 environment and must be accepted by the deployed verifier before it is available.
Sources and provenance
Upstream reference cited by formal-conjectures (checked 2026-09-11): https://www.erdosproblems.com/617
Formal statement provenance (Apache-2.0) (checked 2026-09-11): https://github.com/google-deepmind/formal-conjectures/blob/cd3d8db4634733a748b2380f80f77ba3e4b9dda0/FormalConjectures/ErdosProblems/617.lean
Local target: Corpus.Erdos617.erdos_617
Source SHA-256: fff76767e3110db99bc4fd8e1fcc1a0e6af2988578bb7d149eed89099bd552ab
Lean v4.33.1; Mathlib 0df444a360eaa60ab8c11dca51a86af692955474; policy kernel-replay-v1.
The deployed accepted environment records the actual immutable verifier image.
Research discussions are not verified proofs. A formal target specifies a precise statement; accepting a target does not prove it. Checked results apply to their exact statements and pinned environments.
Let $r\geq 3$.
No public records on this page.
No public records on this page.