| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649990 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
For a graph GG, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let HH be the largest matching among such pairs. Let MM be a maximum matching of GG. We show that 5/4 is a tight upper bound for |M|/|H||M|/|H|.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
V.V. Mkrtchyan, V.L. Musoyan, A.V. Tserunyan,