On $2$-pyramidal Hamiltonian cycle systems

A Hamiltonian cycle system of the complete graph minus a 1–factor K2v − I (briefly, an HCS(2v)) is 2-pyramidal if it admits an automorphism group of order 2v − 2 fixing two vertices. In spite of the fact that the very first example of an HCS(2v) is very old and 2-pyramidal, a thorough investigation of this class of HCSs is lacking. We give first evidence that there is a strong relationship between 2-pyramidal HCS(2v) and 1-rotational Hamiltonian cycle systems of the complete graph K2v−1. Then, as main result, we determine the full automorphism group of every 2-pyramidal HCS(2v). This allows us to obtain an exponential lower bound on the number of non-isomorphic 2-pyramidal HCS(2v).

[1]  Marco Buratti,et al.  1-Rotational k-Factorizations of the Complete Graph and New Solutions to the Oberwolfach Problem , 2008 .

[2]  Richard A. Brualdi,et al.  Symmetric Hamilton cycle decompositions of complete graphs minus a 1‐factor , 2011 .

[3]  Mike J. Grannell,et al.  Even-cycle systems with prescribed automorphism groups , 2013 .

[4]  Marco Buratti,et al.  Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph , 2013 .

[5]  Marco Buratti,et al.  A collection of results on Hamiltonian cycle systems with a nice automorphism group , 2013, Electron. Notes Discret. Math..

[6]  M. A. Ollis Sequenceable Groups and Related Topics , 2013 .

[7]  Brendan D. McKay,et al.  3-Perfect hamiltonian decomposition of the complete graph , 2013, Australas. J Comb..

[8]  Eric Mendelsohn On the Groups of Automorphisms of Steiner Triple and Quadruple Systems , 1978, J. Comb. Theory, Ser. A.

[9]  G. J. Lovegrove Odd-cycle systems with prescribed automorphism groups , 2014 .

[10]  Giuseppe Mazzuoccolo,et al.  On 2‐factorizations of the complete graph: From the k‐pyramidal to the universal property , 2009 .

[11]  Joy Morris,et al.  Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor , 2008, Discret. Math..

[12]  Jin Akiyama,et al.  Symmetric Hamilton cycle decompositions of the complete graph , 2004 .

[13]  M. Buratti,et al.  Doubly transitive 2‐factorizations , 2007 .

[14]  B. A. Anderson,et al.  Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing , 1993 .

[15]  Marco Buratti,et al.  Cyclic Hamiltonian cycle systems of the complete graph , 2004, Discret. Math..

[16]  R. A. Bailey,et al.  Round-dance neighbour designs from terraces , 2003, Discret. Math..