Algebraic Graph Theory Seminar - Chris Godsil

Monday, January 25, 2021 11:30 am - 11:30 am EST (GMT -05:00)

Title: The Matchings Polynomial

Speaker: Chris Godsil
Affiliation: University of Waterloo
Zoom: Contact Soffia Arnadottir


A $k$-matching in a graph is a matching of size $k$, and $p(X,k)$ denotes the number of $k$-matchings in $X$.

The matching polynomial of a graph is a form of generating function for the sequence $(p(X,k))_{k\ge0}$.

If is closely related to the characteristic polynomial of a graph. I will discuss some of the many interesting properties of this polynomial, and some of the related open problems.