A short proof of Kotzig's theorem
Combinatorics
2014-02-06 v1
Abstract
A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theorem about edge-colored graph without alternating cycle. We present a proof of Yeo's Theorem based on the same ideas as our proof of Kotzig's theorem.
Cite
@article{arxiv.1402.0949,
title = {A short proof of Kotzig's theorem},
author = {Gleb Nenashev},
journal= {arXiv preprint arXiv:1402.0949},
year = {2014}
}
Comments
3 pages, 2 figures