Abstract
We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisations (P1Fs) of the complete graph $K_{16}$. Of these, 89 have a nontrivial automorphism group (correcting an earlier claim of 88 by Meszka and Rosa [‘Perfect 1-factorisations of $K_{16}$ with nontrivial automorphism group’, J. Combin. Math. Combin. Comput. 47 (2003), 97–111]). We also (i) describe a new invariant which distinguishes between the P1Fs of $K_{16}$, (ii) observe that the new P1Fs produce no atomic Latin squares of order 15 and (iii) record P1Fs for a number of large orders that exceed prime powers by one.
Publisher
Cambridge University Press (CUP)
Reference14 articles.
1. Perfect 1-factorizations
2. New families of atomic Latin squares and perfect 1-factorisations
3. [5] Meszka, M. , ‘There are 3155 nonisomorphic perfect 1-factorizations of $K_{16}$ ’, submitted for publication.
4. Combinatorial isomorphism problems involving 1-factorizations;Colbourn;Ars Combin.,1980
5. Switching in one-factorisations of complete graphs;Kaski;Electron. J. Combin.,2014
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献