Multi-Colouring of Kneser Graphs: Notes on Stahl's Conjecture

Jan van den Heuvel, Xinyi Xu

A (finite, undirected) graph is $(n,k)$-colourable if we can assign each vertex a $k$-subset of $\{1,2,\dots ,n\}$ so that adjacent vertices receive disjoint subsets. We consider t…