加载中…
2007-08-14
On Edge-Disjoint Pairs Of Matchings
V. V. MkrtchyanV. L. MusoyanA. V. Tserunyan
文献摘要
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|.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本