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

Lovász大教堂定理的第三种证明

The Third Proof of Lovász's Cathedral Theorem

Nanao Kita

摘要:

一个具有完美匹配的图$G$称为饱和图,如果对于不在$G$中的任何边$e$,$G+e$具有比$G$更多的完美匹配。Lovász给出了饱和图的一个特征,称为大教堂定理,并将其应用于完美匹配的计数问题,后来Szigeti给出了另一个证明。本文在前人工作的基础上给出了一个新的证明,揭示了具有完美匹配的一般图的标准结构。在这里,大教堂定理是在一个相当自然的方式得出的,提供了更精细或广义的性质。此外,新的证明表明,它可以证明不使用Gallai-Edmonds结构定理。

英文摘要:

A graph $G$ with a perfect matching is called saturated if $G+e$ has more perfect matchings than $G$ for any edge $e$ that is not in $G$. Lovász gave a characterization of the saturated graphs called the cathedral theorem, with some applications to the enumeration problem of perfect matchings, and later Szigeti gave another proof. In this paper, we give a new proof with our preceding works which revealed canonical structures of general graphs with perfect matchings. Here, the cathedral theorem is derived in quite a natural way, providing more refined or generalized properties. Moreover, the new proof shows that it can be proved without using the Gallai-Edmonds structure theorem.

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

↑