On edge-disjoint pairs of matchings

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|.