Back to Search
Start Over
On the Existence of Zero-Sum Perfect Matchings of Complete Graphs
- Publication Year :
- 2020
- Publisher :
- arXiv, 2020.
-
Abstract
- In this paper, we prove that given a 2-edge-coloured complete graph $K_{4n}$ that has the same number of edges of each colour, we can always find a perfect matching with an equal number of edges of each colour. This solves a problem posed by Caro, Hansberg, Lauri, and Zarb. The problem is also independently solved by Ehard, Mohr, and Rautenbach.<br />Comment: 12 pages, 6 figures, 3 tables, submitted
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....41ee85d550ac1c85f93c045a49aa04fa
- Full Text :
- https://doi.org/10.48550/arxiv.2011.00862