Cayley numbers with arbitrarily many distinct prime factors
From MaRDI portal
Publication:345085
Abstract: A positive integer is a Cayley number if every vertex-transitive graph of order is a Cayley graph. In 1983, Dragan Maruv{s}iv{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set of primes such that every finite product of distinct elements from 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 of distinct elements from , every transitive group of degree contains a semiregular element.
Recommendations
- Families of non-congruent numbers with arbitrarily many prime factors
- Families of non-congruent numbers with arbitrarily many pairs of prime factors
- Numbers with \(n\) different prime factors in their prime factorization
- Prime factorization of integral Cayley octaves
- Number of prime factors with a given multiplicity
- Number of prime factors over arithmetic progressions
- On the number of distinct exponents in the prime factorization of an integer
- Prime factors of class number of cyclotomic fields
- On the number of prime factors of a finite arithmetical progression
- Class numbers with many prime factors
Cites work
- scientific article; zbMATH DE number 3849262 (Why is no real title available?)
- scientific article; zbMATH DE number 1279032 (Why is no real title available?)
- scientific article; zbMATH DE number 558656 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- Classification of vertex-transitive graphs of order a prime cubed. I
- Minimal normal subgroups of transitive permutation groups of square-free degree
- On a Class of Fixed-Point-Free Graphs
- On finite simple groups of characteristic 2 type
- On non-Cayley vertex-transitive graphs of order a product of three primes
- On semiregular elements of solvable groups.
- On solvable groups and Cayley graphs
- On solvable groups and circulant graphs
- On vertex symmetric digraphs
- On vertex-transitive, non-Cayley graphs of order \(pqr\)
- Primitive Permutation Groups Containing an Element of Large Prime Order
- Research problems
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
- Vertex-transitive graphs that are not Cayley graphs. II
Cited in
(7)- Cayley graphs of more than one abelian group
- Some algebraic properties of Sierpiński-type graphs
- The automorphism group of a complementary prism
- On cubic vertex-transitive non-Cayley graphs of 2-power orders
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
- Existence of non-Cayley Haar graphs
- Enumerating graphs via even/odd dichotomy
This page was built for publication: Cayley numbers with arbitrarily many distinct prime factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345085)