Answers are grounded in this paper and cite their sources.
We record computer-assisted proofs of two fixed cases of a problem of Erdős and Gyárfás. Every seven-coloring of the edges of K50 has eight vertices whose induced edges omit a color, and every eight- coloring of the edges of K65 has nine vertices whose induced edges omit a color. The seven-color proof uses a direct exhaustive lemma on weighted graphs with seven vertices. The eight-color proof uses a human full-color extremal argument together with 862 independently reconstructed and LRAT-checked finite instances. The accompanying repository contains the source, semantic verifiers, manifests, replay script, and proof artifacts. These results are being circulated for independent checking and have not yet received external mathematical review. Neither result settles the problem for arbitrary r.
No takes yet. Share an insight, caveat, or question.
Robert Sneiderman (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: