Short proof of the Gallai-Edmonds Structure Theorem
英文摘要：
We derive the Gallai-Edmonds Structure Theorem from Hall's Theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial
In this paper, we prove the Gallai-Edmonds structure theorem for the most general matching polynomial. Our result implies the Parter-Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian matrix whose graph is a tree. keywords:
math.CO
An Analogue of the Gallai-Edmonds Structure Theorem for Nonzero Roots of the Matching Polynomial
Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a graph coincides with the classical notion of deficiency. From this fact he asked to what extent classical results in matching theory generalize, replacing "deficiency" with multiplicity of $θ$ as a root of the matching polynomial. We prove an analogue of the Stability Lemma for any given root, which describes how the matching structure of a graph changes upon deletion of a single vertex. An analogue of Gallai's Lemma follows. Together these two results imply an analogue of the Gallai-Edmonds St…
math.CO
加权匹配多项式的精细 Gallai-Edmonds 结构定理
A refined Gallai-Edmonds structure theorem for weighted matching polynomials
本文利用匹配多项式与分支连分式的联系，证明了加权匹配多项式 Gallai-Edmonds 结构定理的精细化版本，并揭示其与 Sylvester 修改的 Sturm 定理的关系，同时给出匹配多项式零点的新结果。
math.CO
Juniper Green与Gallai-Edmonds分解
Juniper Green and the Gallai-Edmonds Decomposition
University of Washington（华盛顿大学）
本文通过分析简单组合游戏Juniper Green，发现其与可除图的Gallai-Edmonds分解有关，揭示了游戏胜利策略及分解的有趣模式。
math.CO
Matchings in balanced hypergraphs
We give a new proof of König's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new characterizations of balanced hypergraphs and show some properties of matchings and vertex cover in balanced hypergraphs.
math.CO
斯特布尔-德明格图：特征化
Sterboul-Deming Graphs: Characterizations
Universidad Nacional de San Luis（圣路易斯国立大学）；IMASL-CONICET（阿根廷国家科学研究委员会圣路易斯数学与应用研究所）
本文研究了斯特布尔-德明格图的特征化，通过构造性算法和加拉伊-埃德蒙兹分解，揭示了其结构特性及广泛的应用范围。
math.CO
更多相关论文收起更多论文
匹配问题的一个广义 Ramsey--Turán 问题
A generalised Ramsey--Turán problem for matchings
本文证明了关于匹配的广义 Ramsey--Turán 定理，通过显式构造和基于 Gallai--Edmonds 分解的复杂压缩算法，确定了在特定边着色条件下图中完全子图的最大数量。
math.CO
A Strengthening of Erdős-Gallai Theorem and Proof of Woodall's Conjecture
For a 2-connected graph $G$ on $n$ vertices and two vertices $x,y\in V(G)$, we prove that there is an $(x,y)$-path of length at least $k$ if there are at least $\frac{n-1}{2}$ vertices in $V(G)\backslash \{x,y\}$ of degree at least $k$. This strengthens a well-known theorem due to Erdős and Gallai in 1959. As the first application of this result, we show that a 2-connected graph with $n$ vertices contains a cycle of length at least $2k$ if it has at least $\frac{n}{2}+k$ vertices of degree at least $k$. This confirms a 1975 conjecture made by Woodall. As another applications, we obtain some re…
math.CO
The Third Proof of Lovász's Cathedral Theorem
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 ne…
cs.DMmath.CO
