Cayley numbers with arbitrarily many distinct prime factors

DOI10.1016/J.JCTB.2016.06.005zbMATH Open1350.05058arXiv1509.05221OpenAlexW2963571767MaRDI QIDQ345085FDOQ345085

Authors: Ted Dobson, Pablo Spiga 

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ 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 $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.

Full work available at URL: https://arxiv.org/abs/1509.05221

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

zbMATH Keywords

Cayley graphvertex-transitiveCayley numbersemiregular elements

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Primitive Permutation Groups Containing an Element of Large Prime Order
• On finite simple groups of characteristic 2 type
• Title not available (Why is that?)
• On a Class of Fixed-Point-Free Graphs
• Vertex-transitive graphs that are not Cayley graphs. II
• On vertex symmetric digraphs
• On solvable groups and circulant graphs
• On vertex-transitive, non-Cayley graphs of order \(pqr\)
• Classification of vertex-transitive graphs of order a prime cubed. I
• Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
• On non-Cayley vertex-transitive graphs of order a product of three primes
• On semiregular elements of solvable groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Research problems
• Minimal normal subgroups of transitive permutation groups of square-free degree
• On solvable groups and Cayley graphs

Cited In (7)

• The automorphism group of a complementary prism
• Cayley graphs of more than one abelian group
• On cubic vertex-transitive non-Cayley graphs of 2-power orders
• Enumerating graphs via even/odd dichotomy
• Some algebraic properties of Sierpiński-type graphs
• Existence of non-Cayley Haar graphs
• Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.

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)