paper

On Edge-Disjoint Pairs Of Matchings

arXiv:0708.1903 · doi:10.1016/j.disc.2007.09.061

Abstract

For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for |M|/|H|.

arXiv comment8 pages, 2 figures, Submitted to Discrete Mathematics

References in corpus (3)

Cited by in corpus (5)