Discrete Math Seminar Spring 2009
Threshold graphs and the Grone-Merris conjecture
Jamie Radcliffe, UNL;
Jan 20
The Grone-Merris conjecture is a conjectural inequality relating the
eigenvalues of (the Laplacian) of a graph and its degree sequence. It is
known to hold with equality for an interesting class of graphs called
threshold graphs. I will introduce the graphs, the ineqaulity, and some of
the known results.