The chromatic number of finite type-graphs

Christian Avart, Bill Kay, Christian Reiher +1

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\dots ,n\}$ for some integers $n\ge k\ge 1$, and in which two such sets ar…