On Edge-Disjoint Pairs Of Matchings
classification
💻 cs.DM
keywords
pairsedge-disjointmatchingmatchingsboundconsiderconsistsedges
read the original 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|.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.