Semiregular automorphisms of edge-transitive graphs

Michael Giudici; P. Potočnik; Gabriel Verret

doi:10.1007/s10801-014-0515-8

Semiregular automorphisms of edge-transitive graphs

Michael Giudici, P. Potočnik, Gabriel Verret

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

245 Downloads (Pure)

Abstract

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial 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.

Original language	English
Pages (from-to)	961-972
Journal	Journal of Algebraic Combinatorics
Volume	40
Issue number	4
Early online date	28 Mar 2014
DOIs	https://doi.org/10.1007/s10801-014-0515-8
Publication status	Published - Dec 2014

Access to Document

10.1007/s10801-014-0515-8

Download full text
The final publication is available at Springer via http://dx.doi.org/10.1007/s10801-014-0515-8
Accepted author manuscript, 275 KB

Cite this

@article{69442b8994b145c2bbcb54e6d4ac540a,

title = "Semiregular automorphisms of edge-transitive graphs",

abstract = "The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial 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.",

author = "Michael Giudici and P. Poto{\v c}nik and Gabriel Verret",

year = "2014",

month = dec,

doi = "10.1007/s10801-014-0515-8",

language = "English",

volume = "40",

pages = "961--972",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - Semiregular automorphisms of edge-transitive graphs

AU - Giudici, Michael

AU - Potočnik, P.

AU - Verret, Gabriel

PY - 2014/12

Y1 - 2014/12

N2 - The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial 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.

AB - The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial 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.

U2 - 10.1007/s10801-014-0515-8

DO - 10.1007/s10801-014-0515-8

M3 - Article

SN - 0925-9899

VL - 40

SP - 961

EP - 972

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 4

ER -

Semiregular automorphisms of edge-transitive graphs

Abstract

Access to Document

Fingerprint

Cite this