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.
机构:
Paris Dauphine Univ, CEREMADE, Paris, FranceParis Dauphine Univ, CEREMADE, Paris, France
Attia, Luc
Lichev, Lyuben
论文数: 0引用数: 0
h-index: 0
机构:
Univ Jean Monnet, St Etienne, France
Bulgarian Acad Sci, Inst Math & Informat, Sofia, Bulgaria
Inst Sci Technol Austria, Klosterneuburg, AustriaParis Dauphine Univ, CEREMADE, Paris, France
Lichev, Lyuben
Mitsche, Dieter
论文数: 0引用数: 0
h-index: 0
机构:
Univ Jean Monnet, St Etienne, France
Pontificia Univ Catolica, Inst Math & Computat Engn, Santiago, ChileParis Dauphine Univ, CEREMADE, Paris, France
机构:
CNRS, UMR 5219, Toulouse, France
Toulouse Sch Econ, Toulouse, France
Univ Toulouse Capitole, Toulouse, France
Inst Math Toulouse, Toulouse, FranceParis Dauphine Univ, CEREMADE, Paris, France