arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.1903cs.DM
收藏

关于边不相交匹配对

On Edge-Disjoint Pairs Of Matchings

V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan

摘要:

对于图G,考虑边不相交匹配对,其并集由尽可能多的边组成。设H是这些对中最大的匹配。设M是G的最大匹配.我们证明了5/4是|M| / |H|的紧上界。

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑