Transitive decompositions of graph products: rank 3 grid type

    Research output: Contribution to journalArticle

    4 Citations (Scopus)

    Abstract

    A transitive decomposition is a pair (Gamma, P) where Gamma is a graph and P is a partition of the arc set of Gamma, such that there exists a group of automorphisms of Gamma which leaves 9 invariant and transitively permutes the parts in P. This paper concerns transitive decompositions where the group is a primitive rank 3 group of 'grid' type. The graphs Gamma 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.
    Original languageEnglish
    Pages (from-to)185-228
    JournalJournal of Group Theory
    Volume11
    Issue number2
    DOIs
    Publication statusPublished - 2008

    Fingerprint Dive into the research topics of 'Transitive decompositions of graph products: rank 3 grid type'. Together they form a unique fingerprint.

  • Cite this