Neighbour-transitive codes in Kneser graphs

Dean Crnković, Daniel R. Hawtin, Nina Mostarac +1

A code $C$ is a subset of the vertex set of a graph and $C$ is $s$-neighbour-transitive if its automorphism group $\mathrm{Aut}(C)$ acts transitively on each of the first $s+1$ parts…