Cayley numbers with arbitrarily many distinct prime factors
Preprint
Abstract
A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of primes such that every finite product of distinct elements from $S$ is a Cayley number. This answers a 1996 outstanding question of Brendan McKay and Cheryl Praeger, which they "believe to be the key unresolved question" on Cayley numbers. We also show that, for every finite product $n$ of distinct elements from $S$, every transitive group of degree $n$ contains a semiregular element.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- On Semiregular Elements of Solvable GroupsCommunications in Algebra, 2011
- On solvable groups and Cayley graphsJournal of Combinatorial Theory, Series B, 2008
- Minimal normal subgroups of transitive permutation groups of square-free degreeDiscrete Mathematics, 2007
- On Non-Cayley Vertex-Transitive Graphs of Order a Product of Three PrimesJournal of Combinatorial Theory, Series B, 2001
- On Solvable Groups and Circulant GraphsEuropean Journal of Combinatorics, 2000
- On vertex-transitive, non-Cayley graphs of order pqrDiscrete Mathematics, 1998
- Vertex-transitive graphs which are not Cayley graphs, IJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1994
- Primitive Permutation Groups Containing an Element of Large Prime OrderJournal of the London Mathematical Society, 1985
- On vertex symmetric digraphsDiscrete Mathematics, 1981
- A Course in Arithmetic1973