A Perfect One-Factorisation of $K_{56}$
Combinatorics
2019-02-05 v2
Abstract
In 1963, Anton Kotzig conjectured that for each the complete graph has a perfect one-factorisation (i.e., a decomposition into perfect matchings such that each pair of perfect matchings of the decomposition induces a Hamilton cycle). We affirmatively settle the smallest unresolved case for this conjecture.
Cite
@article{arxiv.1810.08734,
title = {A Perfect One-Factorisation of $K_{56}$},
author = {David A. Pike},
journal= {arXiv preprint arXiv:1810.08734},
year = {2019}
}