Minimum rank of complements of Kneser graphs
Abstract
We determine the symmetric minimum rank of the complement of the Kneser graph KG(n,k) over every infinite field. More precisely, if I(n,k) is the graph on the k-subsets of [n] in which two vertices are adjacent exactly when they intersect, then mr F(I(n,k))=n-2k+2 for every infinite field F and all integers n,k with 2 k 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.