Minimum rank of complements of Kneser graphs
Combinatorics
2026-07-07 v1
Abstract
We determine the symmetric minimum rank of the complement of the Kneser graph over every infinite field. More precisely, if is the graph on the -subsets of in which two vertices are adjacent exactly when they intersect, then for every infinite field and all integers with . In particular, over the real numbers, this settles a question posed in the AIM workshop open questions report on spectra of families of matrices described by graphs.
Cite
@article{arxiv.2607.06480,
title = {Minimum rank of complements of Kneser graphs},
author = {Tao Hu and Quanyu Tang},
journal= {arXiv preprint arXiv:2607.06480},
year = {2026}
}
Comments
7 pages