Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Visit our COVID-19 information website to learn how Warriors protect Warriors.
Please note: The University of Waterloo is closed for all events until further notice.
Title: The Matchings Polynomial
Speaker: Chris Godsil Affiliation: University of Waterloo Zoom: Contact Soffia ArnadottirAbstract:
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.
Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office.