# Algebraic Graph Theory Seminar - Chris Godsil

Monday, January 25, 2021 — 11:30 AM EST

Title: The Matchings Polynomial

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

Abstract:

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.

### January 2022

S M T W T F S
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
12
14
15
16
19
20
22
23
26
29
30
1
2
3
4
5
1. 2022 (71)
1. June (2)
2. May (17)
3. April (12)
4. March (18)
5. February (10)
6. January (13)
2. 2021 (103)
1. December (3)
2. November (7)
3. October (6)
4. September (12)
5. August (6)
6. July (10)
7. June (12)
8. May (7)
9. April (9)
10. March (13)
11. February (8)
12. January (10)
3. 2020 (119)
4. 2019 (167)
5. 2018 (136)
6. 2017 (103)
7. 2016 (137)
8. 2015 (136)
9. 2014 (88)
10. 2013 (48)
11. 2012 (39)
12. 2011 (36)
13. 2010 (40)
14. 2009 (40)
15. 2008 (39)
16. 2007 (15)