Primitive decompositions of Johnson graphs (Q941310): Difference between revisions

The Johnson graph \(J(n,k)\) is the graph with vertices representing the \(k\)-element subsets of a set with \(n\) vertices where two vertices are adjacent if the corresponding sets have \(k-1\) elements in common. A transitive decomposition of a graph \(G\) is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In the paper all transitive decompositions of Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts are determined.