Generalizations of the matching polynomial to the multivariate independence polynomial
From MaRDI portal
Publication:2328133
DOI10.5802/alco.63zbMath1434.05075arXiv1610.00805OpenAlexW2980075253WikidataQ127171456 ScholiaQ127171456MaRDI QIDQ2328133
Publication date: 9 October 2019
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00805
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Mixed determinants and the Kadison-Singer problem ⋮ Peaks are preserved under run-sorting ⋮ Peaks are preserved under run-sorting (extended abstract) ⋮ Free fermions behind the disguise ⋮ Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- The roots of the independence polynomial of a clawfree graph
- Distance-hereditary graphs
- Bounds on the largest root of the matching polynomial
- Homogeneous multivariate polynomials with the half-plane property
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Polynomials with the half-plane property and matroid theory
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Theory of monomer-dimer systems
- Dependence polynomials
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
- Christoffel–Darboux Type Identities for the Independence Polynomial
This page was built for publication: Generalizations of the matching polynomial to the multivariate independence polynomial