![](/files/happy5.png)
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
.
![$ r $](/files/tex/535dee6c3b72bcc4d571239ed00be162ee1e6fbe.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ r $](/files/tex/535dee6c3b72bcc4d571239ed00be162ee1e6fbe.png)
Keywords: matching polynomial; vertex-transitive
![Syndicate content Syndicate content](/misc/feed.png)