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

DOI10.1002/JCD.20188MaRDI QIDQ3619607zbMATH OpenOpenAlexWikidataFDO

Authors 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

automorphism groupclassificationone-factorization

Mathematics Subject Classification ID

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

Abstract: We establish by means of a computer search that a complete graph on 14 vertices has 98,758,655,816,833,727,741,338,583,040 distinct and 1,132,835,421,602,062,347 nonisomorphic one-factorizations. The enumeration is constructive for the 10,305,262,573 isomorphism classes that admit a nontrivial automorphism.

Recommendations

• scientific article; zbMATH DE number 1228802
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• scientific article; zbMATH DE number 4070947
• Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\)
• Perfect 1-factorisations of \(K_{16}\)
• scientific article; zbMATH DE number 4118407
• scientific article; zbMATH DE number 2061799
• A perfect one-factorization of \(K_{36}\)
• A perfect one-factorization for \(K_{36}\)
• A perfect one-factorization ofK₅₂

Cites work

• Classification algorithms for codes and designs
• Fast generation of regular graphs and construction of cages
• scientific article; zbMATH DE number 1185303 (Why is no real title available?)
• scientific article; zbMATH DE number 3494466 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• Isomorph-Free Exhaustive Generation of Designs with Prescribed Groups of Automorphisms
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
• On the number of Latin squares
• Small latin squares, quasigroups, and loops
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂

Cited in

(20)

• One-factorisations of complete graphs arising from ovals in finite planes
• One-factorizations of regular graphs of order 12
• Higher melonic theories
• Efficient, local and symmetric Markov chains that generate one-factorizations
• A classification of hyperfocused 12-arcs
• Factorisation of the complete graph into spanning regular factors
• 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)
• scientific article; zbMATH DE number 3922704 (Why is no real title available?)
• Enumerating perfect matchings in n-cubes
• Switching in one-factorisations of complete graphs
• scientific article; zbMATH DE number 1228802 (Why is no real title available?)
• New results on torus cube packings and tilings
• Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs
• Enumeration of Steiner triple systems with subsystems
• On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
• Enumerating Steiner triple systems
• Enumeration of Latin squares with conjugate symmetry
• There are 3155 nonisomorphic perfect one‐factorizations of K₁₆

Describes a project that uses

Uses Software

• nauty
• GENREG
• gmp

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3619607)