2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/170952For 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|.8 pages, 2 figures, Submitted to Discrete MathematicsDiscrete Mathematicstext