Primitive decompositions of Johnson graphs
classification
🧮 math.CO
keywords
decompositionsgraphsgroupjohnsonpartitionpartstransitiveacts
read the original abstract
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.