John Urschel, Massachusetts Institute of Technology
Odegaard 136
Spectral graph theory deals with the eigenvalues and eigenvectors of matrix representations of graphs. In this talk, we will give a brief introduction to the field, covering topics including the Perron-Frobenius theorem, bipartite graphs, the max cut problem, and, if time permits, the Goemans-Williamson max cut algorithm. This talk is designed for undergraduate students who are interested in mathematics and its applications.