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 hypergraph normalized Laplacian - Lies Beers (Vrije Univers
 iteit Amsterdam)
DTSTART:20240801T102500Z
DTEND:20240801T105000Z
UID:TALK219640@talks.cam.ac.uk
DESCRIPTION:We introduce the normalized Laplacian for graphs and a general
 ization to hypergraphs. We give some properties of its spectrum and provid
 e a bound relating the smallest and largest eigenvalue to the chromatic nu
 mber. We study this bound in the context of uniform unoriented hypergraphs
 .
LOCATION:External
END:VEVENT
END:VCALENDAR