Joint Graduate Student ColloquiumExport this event to calendar

Tuesday, June 9, 2015 — 4:30 PM EDT

Zack Cramer, Pure Mathematics Department, University of Waterloo

"The Matrix-Tree Theorem"

The matrix-tree theorem states that the number of spanning trees of a graph can be computed as the determinant of a certain matrix derived from the graph. We will showcase an elementary proof that arises as an application of the Cauchy-Binet theorem, an elegant result from linear algebra that generalizes the multiplicative property of the determinant. Finally, we will state an interesting reformulation of the matrix-tree theorem and examine some quick applications in graph theory.

MC 2035

 

 

 

 

S M T W T F S
27
28
29
30
31
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
  1. 2019 (177)
    1. November (11)
    2. October (19)
    3. September (13)
    4. August (7)
    5. July (12)
    6. June (18)
    7. May (22)
    8. April (11)
    9. March (25)
    10. February (17)
    11. January (22)
  2. 2018 (219)
    1. December (2)
    2. November (32)
    3. October (27)
    4. September (26)
    5. August (4)
    6. July (9)
    7. June (13)
    8. May (17)
    9. April (13)
    10. March (28)
    11. February (27)
    12. January (21)
  3. 2017 (281)
  4. 2016 (335)
  5. 2015 (209)
  6. 2014 (235)
  7. 2013 (251)
  8. 2012 (135)