Metraipolis › archive › dc_16fc2d84947d

Perfect 1-factorisations of $K_{18}$ with a non-trivial automorphism group — arXiv:2611.01807

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01807
License (as archived)
CC0-1.0
Archived
2026-11-03T18:49:48.605Z
SHA-256 of the archived text
fd02ec42b2e363345f2bef936eb9f8e1154c24dac4745514d7c5fcc58b02c998
Stable URL of this page
https://metraipolis.com/documento/dc_16fc2d84947d

How to cite

Perfect 1-factorisations of $K_{18}$ with a non-trivial automorphism group — arXiv:2611.01807 — arXiv (en), https://arxiv.org/abs/2611.01807 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_16fc2d84947d (Metraipolis archive dc_16fc2d84947d, sha256 fd02ec42b2e363345f2bef936eb9f8e1154c24dac4745514d7c5fcc58b02c998)
BibTeX
@misc{dc16fc2d84947d,
  title = {Perfect 1-factorisations of $K_18$ with a non-trivial automorphism group — arXiv:2611.01807},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01807},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_16fc2d84947d; sha256 fd02ec42b2e363345f2bef936eb9f8e1154c24dac4745514d7c5fcc58b02c998},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01807. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A perfect 1-factorisation (P1F) of $K_{2n}$ is a partition of its edges into $2n-1$ perfect matchings, any two of which form a Hamiltonian cycle. Exhaustive classification is known only up to $K_{16}$. We present a method for the exhaustive generation, up to isomorphism, of perfect 1-factorisations with a non-trivial automorphism group, which reduces the search tree far enough to make $K_{18}$ and beyond feasible. It combines two ideas. For automorphism groups of order greater than 2, classical results of Ihrig on the automorphisms of P1Fs are used as tools that reject almost all prescribed cycle types without search. For the order-2 case, which dominates, candidates are recalculated from inherited compatibility lists, in the spirit of Gill and Wanless, with an outer loop over two further rows that keeps those lists small, and Ihrig's results restrict the first factor. As the numerical proof of the method we compute all 10,710 P1Fs of $K_{18}$ with a non-trivial automorphism group; before, only six were known.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01807 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.079Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).