Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial
classification
🧮 math.CO
keywords
theoremgallai-edmondsmatchingpolynomialstructureexistencegeneralgeneralization
read the original abstract
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:
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.