BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:At both ends of the spectrum: Chromatic bounds for the largest eig
 envalue of the normalized Laplacian - Lies Beers (Vrije Universiteit Amste
 rdam)
DTSTART:20240815T100000Z
DTEND:20240815T110000Z
UID:TALK219652@talks.cam.ac.uk
DESCRIPTION:For a graph with largest normalized Laplacian eigenvalue lambd
 a and (vertex) coloring number chi\, lambda is known to be larger than or 
 equal to chi/(chi-1). We consider properties of graphs for which this boun
 d is sharp\, and we study the multiplicity of chi/(chi-1). We also look at
  the spectrum of the 1-sum (a graph operation) of two graphs\, with a focu
 s on the maximal eigenvalue.\nWe consider a generalization of the bound fo
 r hypergraphs and consider uniform hypergraphs for which this bound is sha
 rp. Finally\, we study a hypergraph operation and its relation to the hype
 rgraph bound.
LOCATION:External
END:VEVENT
END:VCALENDAR