Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs

P. Potočnik, P. Spiga, Gabriel Verret

    Research output: Contribution to journalArticle

    14 Citations (Scopus)

    Abstract

    © 2014 Elsevier Inc. The main result of this paper is that, if Γ is a connected 4-valent G-arc-transitive graph and v is a vertex of Γ, then either Γ is part of a well-understood infinite family of graphs, or |Gv|≤2436 or 2|Gv|log2(|Gv|/2)≤|VΓ| and that this last bound is tight. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.
    Original languageEnglish
    Pages (from-to)148-180
    Number of pages33
    JournalJournal of Combinatorial Theory. Series B
    Volume111
    DOIs
    Publication statusPublished - Mar 2015

    Fingerprint Dive into the research topics of 'Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs'. Together they form a unique fingerprint.

  • Cite this