1 paper
Hong Liu, Maksim Turevskii, Lanchao Wang +1
The Alon--Frankl--Lovász theorem determines the chromatic number of Kneser hypergraphs; equivalently, it gives the sharp minimum size of a monochromatic matching in every edge-colo…