Primitive decompositions of Johnson graphs

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
175 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)925-966
JournalJournal of Combinatorial Theory Series A
Issue number6
Publication statusPublished - 2008


Dive into the research topics of 'Primitive decompositions of Johnson graphs'. Together they form a unique fingerprint.

Cite this