A refined Gallai-Edmonds structure theorem for weighted matching polynomials

DOI10.1016/j.disc.2022.113244OpenAlexW3037510684WikidataQ122417721 ScholiaQ122417721MaRDI QIDQ2111908

Thomás Jung Spier

Publication date: 17 January 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.15215

zbMATH Keywords

continued fractionSturm's theoremGallai-Edmonds structure theoremweighted matching polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Continued fractions (11A55)

Related Items (1)

Strong cospectrality in trees

Cites Work

• Generalizing Tutte's theorem and maximal non-matchable graphs
• Properties of \(\theta\)-super positive graphs
• Extensions of barrier sets to nonzero roots of the matching polynomial
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Algebraic matching theory
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Gallai-Edmonds structure theorem for weighted matching polynomial
• Theory of monomer-dimer systems
• On the theory of the matching polynomial
• Matchings and walks in graphs
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A refined Gallai-Edmonds structure theorem for weighted matching polynomials