Arc-transitive graphs of valency 8 have a semiregular automorphism
Combinatorics
2013-03-20 v1
Abstract
One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.
Keywords
Cite
@article{arxiv.1303.4501,
title = {Arc-transitive graphs of valency 8 have a semiregular automorphism},
author = {Gabriel Verret},
journal= {arXiv preprint arXiv:1303.4501},
year = {2013}
}
Comments
5 pages