Homogeneous factorisations of Johnson graphs

For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part of E, while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.

• Type: Conference
• Year: 2008
• Where: DCC
• Authors: Maria Cristeta Cuaresma, Michael Giudici, Cheryl E. Praeger
• Keywords: Computer Graphics, DCC 2008, Finite Johnson Graphs, Homogeneous Factorisations, Sporadic Examples