Chromatic numbers of some distance graphs (Q2191956)

For positive integers \(n > r > s\), \(G(n, r, s)\) is the graph whose vertices are the \(r\)-element subsets of an \(n\)-element set, two subsets being adjacent if their intersection contains exactly \(s\) elements. The paper studies the chromatic numbers of this family of graphs. In particular, the exact value of the chromatic number of \(G(n, 3, 2)\) is determined for infinitely many \(n\). Furthermore, upper bounds for the chromatic number of such graphs for some values of \(r\) and \(s\) and sufficiently large \(n\) are proved.