Tutte seminar - Chris Godsil
The Matching Polynomial of a Graph
Speaker: | Chris Godsil |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics 3 (M3) 3103 |
Abstract:
If p(G,k) denotes the number of matchings of size k in the graph G and n=|V(G)|, then the matching polynomial of G is
m(G,t) = \sum_k p(G,k) (-1)^k t^{n-2k}.