University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Tutte seminar - Chris GodsilExport this event to calendar

Friday, October 17, 2014 — 3:30 PM EDT

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}.

Thus it is a form of generating function for the matchings in a graph. The matching polynomial was first used in physics and in chemistry; more recently it has featured in the construction of Ramanujan graphs
by Marcus et al. In my talk I will discuss some of the history of this polynomial, and some of its surprising properties.

Location 
M3 - Mathematics 3
3103
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

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