On the generalized Erdős--Kneser conjecture: proofs and reductions

Jai Aslam, Shuli Chen, Ethan Coldren +2

Alon, Frankl, and Lovász proved a conjecture of Erdős that one needs at least $\lceil \frac{n-r(k-1)}{r-1}\rceil$ colors to color the $k$-subsets of $\{1,\dots ,n\}$ such that an…