There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14

DOI10.1002/jcd.20188zbMath1184.05097arXiv0801.0202OpenAlexW2018452700WikidataQ114236282 ScholiaQ114236282MaRDI QIDQ3619607

Petteri Kaski, Patric R. J. Östergård

Publication date: 8 April 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

classificationautomorphism groupone-factorization

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (17)

The number of Latin squares of order 11 ⋮ Edge coloring: a natural model for sports scheduling ⋮ Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\) ⋮ One-factorisations of complete graphs arising from ovals in finite planes ⋮ Enumerating perfect matchings in \(n\)-cubes ⋮ A classification of hyperfocused 12-arcs ⋮ Enumerating Steiner triple systems ⋮ Switching in one-factorisations of complete graphs ⋮ Enumeration of Latin squares with conjugate symmetry ⋮ Factorisation of the complete graph into spanning regular factors ⋮ There are 3155 nonisomorphic perfect one‐factorizations of K₁₆ ⋮ Efficient, local and symmetric Markov chains that generate one-factorizations ⋮ New results on torus cube packings and tilings ⋮ Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs ⋮ Higher melonic theories ⋮ Enumeration of Steiner triple systems with subsystems ⋮ On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs

Uses Software

• gmp
• nauty
• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification algorithms for codes and designs
• On the number of Latin squares
• Small latin squares, quasigroups, and loops
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
• Fast generation of regular graphs and construction of cages
• Isomorph-Free Exhaustive Generation
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms

This page was built for publication: There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄