Arc-transitive graphs of valency 8 have a semiregular automorphism

Gabriel Verret

    Research output: Contribution to journalArticle

    12 Citations (Scopus)
    167 Downloads (Pure)

    Abstract

    One version of the polycirculant conjecture states that every vertex-transitive graph
    has a non-identity semiregular automorphism that is, a non-identity automorphism whose cycles all have the same length. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open valency.
    Original languageEnglish
    Pages (from-to)29-34
    Number of pages6
    JournalArs Mathematica Contemporanea
    Volume8
    Publication statusPublished - Jan 2015

    Fingerprint Dive into the research topics of 'Arc-transitive graphs of valency 8 have a semiregular automorphism'. Together they form a unique fingerprint.

    Cite this