2020/11/02 by Teeradej Kittipassorn, Kittipassorn, Teeradej, Panon Sinsap +1
Mathematics · Social Sciences · #Limits and Structures in Graph Theory #Migration, Ethnicity, and Economy #Japanese History and Culture
paper · pdf · doi:10.48550/arxiv.2011.00862
In this paper, we prove that given a 2-edge-coloured complete graph K4n 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.