On the Existence of Zero-Sum Perfect Matchings of Complete Graphs

DOI10.26493/1855-3974.2573.90DMaRDI QIDQ6352800arXivFDO

Authors Teeradej Kittipassorn

Publication date 2 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.26493/1855-3974.2573.90D

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

arXiv classification

math.CO

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.

This page was built for publication: On the Existence of Zero-Sum Perfect Matchings of Complete Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352800)