Transitive decompositions of graph products: rank 3 grid type

Abstract A transitive decomposition is a pair (Γ, 𝒫) where Γ is a graph and 𝒫 is a partition of the arc set of Γ, such that there exists a group of automorphisms of Γ which leaves 𝒫 invariant and transitively permutes the parts in 𝒫. This paper concerns transitive decompositions where the group is a primitive rank 3 group of ‘grid’ type. The graphs Γ in this case are either products or Cartesian products of complete graphs. We first give some generic constructions for transitive decompositions of products and Cartesian products of copies of an arbitrary graph, and we then prove (except in a small number of cases) that all transitive decompositions with respect to a rank 3 group of grid type can be characterized using these constructions. Furthermore, the main results of this work provide a new proof and insight into the classification of rank 3 partial linear spaces of product action type studied by Devillers.

[1]  Thomas Q. Sibley.  On classifying finite edge colored graphs with two transitive automorphism groups , 2004, J. Comb. Theory, Ser. B.

[2]  Cheryl E. Praeger,et al.  The Inclusion Problem for Finite Primitive Permutation Groups , 1990 .

[3]  Cheryl E. Praeger,et al.  Constructing Homogeneous Factorisations of Complete Graphs and Digraphs , 2002, Graphs Comb..

[4]  William M. Kantor,et al.  Homogeneous Designs and Geometric Lattices , 1985, J. Comb. Theory A.

[5]  Peter J. Cameron.  SGDs with doubly transitive automorphism group , 1999, J. Graph Theory.

[6]  R. Schmidt.  Subgroup Lattices of Groups , 1994 .

[7]  Geoffrey Pearce,et al.  Transitive Decompositions of Graphs and Their Links with Geometry and Origami , 2007, Am. Math. Mon..

[8]  R. W. Robinson.  Isomorphic factorisations VI: Automorphisms , 1979 .

[9]  C. Praeger,et al.  On Partitioning the Orbitals of a Transitive Permutation Group , 2002 .

[10]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[11]  Martin W. Liebeck,et al.  The Finite Primitive Permutation Groups of Rank Three , 1986 .

[12]  Martin W. Liebeck,et al.  The Affine Permutation Groups of Rank Three , 1987 .

[13]  Tian Khoon Lim.  Edge-Transitive Homogeneous Factorisations of Complete Graphs , 2006, math/0605253.

[14]  Cheryl E. Praeger,et al.  A Recognition Algorithm For Classical Groups Over Finite Fields , 1998 .

[15]  P. Cameron,et al.  One‐Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group , 1993 .

[16]  Chris D. Godsil,et al.  ALGEBRAIC COMBINATORICS , 2013 .

[17]  Frank Harary,et al.  Isomorphic factorizations X: Unsolved problems , 1985, J. Graph Theory.