English

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 KG(n,k)\operatorname{KG}(n,k) over every infinite field. More precisely, if I(n,k)I(n,k) is the graph on the kk-subsets of [n][n] in which two vertices are adjacent exactly when they intersect, then mrF(I(n,k))=n2k+2 \operatorname{mr}^{\mathbb F}(I(n,k))=n-2k+2 for every infinite field F\mathbb F and all integers n,kn,k with 2kn/22\le k\le n/2. 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.

Keywords

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