All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on the polycirculant conjecture by proving that every vertex-transitive, locally-quasiprimitive graph has a nonidentity semiregular automorphism. The main ingredient of the proof is the determination of all biquasiprimitive permutation groups with no nontrivial semiregular elements.
Original languageEnglish
Pages (from-to)217-232
JournalJournal of Algebraic Combinatorics
Volume25
Issue number2
DOIs
Publication statusPublished - 2007

Fingerprint Dive into the research topics of 'All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism'. Together they form a unique fingerprint.

Cite this