## 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 non
✦ LIBER ✦
There are 23 nonisomorphic perfect one-factorizations of K14
✍ Scribed by Jeffrey H. Dinitz; David K. Garnick
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 181 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Using an orderly algorithm we established that there are exactly 23 nonisomorphic perfect one-factorizations of K14. Seah and Stinson (Ann. Discrete Math. 34 (1987), 419-436) had previously found 21 perfect one-factorizations of K I A with nontrivial automorphism group.
📜 SIMILAR VOLUMES
There are 1,132,835,421,602,062,347 noni
✍
Petteri Kaski; Patric R. J. Östergård
📂
Article
📅
2009
🏛
John Wiley and Sons
🌐
English
⚖ 130 KB
There are 526,915,620 nonisomorphic one-
✍
Jeffrey H. Dinitz; David K. Garnick; Brendan D. McKay
📂
Article
📅
1994
🏛
John Wiley and Sons
🌐
English
⚖ 724 KB
We enumerate the nonisomorphic and the distinct one-factorizations of K l z . We also describe the algorithm used to obtain the result, and the methols we used to verify these numbers.