
matching polynomial
Matching polynomials of vertex transitive graphs ★★
Author(s): Mohar
Conjecture For every integer
there exists a vertex transitive graph
whose matching polynomial has a root of multiplicity at least
.



Keywords: matching polynomial; vertex-transitive
