Semiregular automorphisms of edge-transitive graphs

From MaRDI portal
Publication:484161

DOI10.1007/S10801-014-0515-8zbMATH Open1304.05059arXiv1306.1971OpenAlexW2013437408MaRDI QIDQ484161FDOQ484161


Authors: Michael Giudici, Primož Potočnik, Gabriel Verret Edit this on Wikidata


Publication date: 18 December 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.


Full work available at URL: https://arxiv.org/abs/1306.1971




Recommendations




Cites Work


Cited In (13)

Uses Software





This page was built for publication: Semiregular automorphisms of edge-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484161)