Fetching the paper…

Reading the bibliography…

2014

Christoffel-Darboux type identities for independence polynomial

Bencs, Ferenc

Original
PDF
Post on X

Understand

In this paper we introduce some Christoffel-Darboux type identities for independence polynomials.

As an application, we give a new proof of a theorem of M.
Chudnovsky and P.
Seymour, claiming that the independence polynomial of a claw-free graph has only real roots.

Christoffel-Darboux type identities for independence polynomial · Around

Built on

Theory of monomer-dimer systems
Ole J. Heilmann and Elliott H. Lieb · 1972
Earlier work this paper cites.
On the theory of the matching polynomial
Christofer David Godsil and Ivan Gutman · 1981
Earlier work this paper cites.
Topological Methods in Chemistry
R.E. Merrifield and H.E. Simmons · 1989
Earlier work this paper cites.

Similar

Graph propagators
I. Gutman · 1990
Cited alongside, same era.
Algebraic combinatorics
Christofer David Godsil · 1993
Cited alongside, same era.
Matching polynomials and duality
Bodo Lass · 2004
Cited alongside, same era.

Then

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
Bodo Lass · 2012
Later among the works it cites.
The Merrifield-Simmons conjecture holds for bipartite graphs
Martin Trinks · 2013
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…