betaFeedback

WorksMathematics

Regular subgroups of wreath products and Cayley Cartesian products

Abstract

The Cartesian product of Cayley graphs is again a Cayley graph. For connected graphs, the converse question reduces to Cartesian powers of Cartesian-prime graphs, and consequently to the study of regular subgroups of wreath products in the product action. We prove that, for a transitive permutation group GG of degree 2p2p or 4p4p, where pp is prime, G≀S2G\wr S_2 contains a regular subgroup if and only if GG does, and construct counterexamples of degree 8p8p for every prime p≡3(mod4)p\equiv3\pmod4. By modifying this construction, we obtain an infinite family of connected non-Cayley graphs whose Cartesian squares are Cayley graphs, giving a negative answer to the converse question. The smallest graph in our family has 120120 vertices and valency 2727. In contrast, we prove that a connected vertex-transitive graph of order pqpq, where pp and qq are primes, has a Cayley Cartesian power if and only if the graph itself is Cayley.

Paper details

vlnc:W_bam2hun8
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI

View statement
Looking for related papers…