Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial
Combinatorics
2010-06-08 v1
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:
Cite
@article{arxiv.1006.1028,
title = {Gallai-Edmonds Structure Theorem for Weighted Matching Polynomial},
author = {Cheng Yeaw Ku and Kok Bin Wong},
journal= {arXiv preprint arXiv:1006.1028},
year = {2010}
}
Comments
34 pages, 5 figures