Chromatic numbers of Kneser-type graphs

Dmitriy Zakharov

Let $G(n,r,s)$ be a graph whose vertices are all $r$-element subsets of an $n$-element set, in which two vertices are adjacent if they intersect in exactly $s$ elements. In this…