加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本