Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654915 | European Journal of Combinatorics | 2006 | 7 Pages |
Abstract
An old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with nn. We prove that there is one of order greater than 2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Cameron, John Sheehan, Pablo Spiga,