Some locally Kneser graphs
arXiv:2312.02964
Abstract
The Kneser graph is the graph on the -subsets of an -set, adjacent when disjoint. Clearly, is locally . Hall showed for that there are no further examples. Here we give other examples of locally graphs for , and some further sporadic examples. It follows that Hall's bound is best possible.