论文标题
关于完整图的零和完美匹配的存在
On the Existence of Zero-Sum Perfect Matchings of Complete Graphs
论文作者
论文摘要
在本文中，我们证明，给定2块颜色的完整图$ k_ {4n} $具有每种颜色的边缘数量相同的边缘，我们始终可以找到一个完美的匹配，每种颜色的边缘相等数量。这解决了Caro，Hansberg，Lauri和Zarb提出的问题。 Ehard，Mohr和Rautenbach也独立解决了这个问题。
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.
