共 50 条
On the existence of zero-sum perfect matchings of complete graphs
被引:2
|作者:
Kittipassorn, Teeradej
[1
]
Sinsap, Panon
[1
]
机构:
[1] Chulalongkorn Univ, Dept Math & Comp Sci, Fac Sci, Bangkok, Thailand
关键词:
Graphs;
zero-sum perfect matching;
TREES;
D O I:
10.26493/1855-3974.2573.90d
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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.
引用
收藏
页数:11
相关论文