Some locally Kneser graphs
Combinatorics
2023-12-06 v1
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.
Keywords
Cite
@article{arxiv.2312.02964,
title = {Some locally Kneser graphs},
author = {A. E. Brouwer},
journal= {arXiv preprint arXiv:2312.02964},
year = {2023}
}