There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K₁₄
classification
🧮 math.CO
keywords
nonisomorphicone-factorizationsadmitautomorphismclassescompletecomputerconstructive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.