arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0712.1014cs.DM
收藏

一类与不交匹配对有关的图的刻画

Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings

A. V. Tserunyan

摘要:

对于一个给定的图,考虑一对不相交的匹配,其并集包含尽可能多的边。此外,考虑最大匹配和最大匹配在这些对中的基数的关系。已知对于任何图,这个关系不超过5/4。我们刻画了这类关系正好是5/4的图。我们的刻画意味着这些图包含一个生成子图,它的每一个分支都是这类图的最小图。

英文摘要:

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is known that this relation does not exceed 5/4 for any graph. We characterize the class of graphs for which this relation is precisely 5/4. Our characterization implies that these graphs contain a spanning subgraph, every component of which is the minimal graph of this class.

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

↑