Families of nested graphs with compatible symmetric-group actions

Eric Ramos, Graham White

For fixed positive integers $n$ and $k$, the Kneser graph $K{G}_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots ,n\}$ and edges between disjoint sets. Keeping $k$ f…