On the diameter of Schrijver graphs

Agustina Victoria Ledezma, Adrián Pastine, Pablo Torres +1

For $k\ge 1$ and $n\ge 2k$, the well known Kneser graph $\mathrm{KG}(n,k)$ has all $k$-element subsets of an $n$-element set as vertices; two such subsets are adjacent if…