–
March 28, 2019
The first result obtained for eigenvalues applied to graph problems is a bound on the chromatic number of a graph in 1973. Since then, many important applications of eigenvalues were discovered. This presentation will summarize some of these results, including properties of eigenvalues and application to combinatorial optimization problems.