2007/12/11 by Alice Devillers, Devillers, Alice, Michael Giudici +5
Computer Science · Engineering · Mathematics · #05C25 #20B25 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0712.1622
openalex publication_date 2007/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.