BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:At both ends of the spectrum: Chromatic bounds for
the largest eigenvalue of the normalized Laplacia
n - Lies Beers (Vrije Universiteit Amsterdam)
DTSTART;TZID=Europe/London:20240815T110000
DTEND;TZID=Europe/London:20240815T120000
UID:TALK219652AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/219652
DESCRIPTION:For a graph with largest normalized Laplacian eige
nvalue lambda and (vertex) coloring number chi\, l
ambda is known to be larger than or equal to chi/(
chi-1). We consider properties of graphs for which
this bound is sharp\, and we study the multiplici
ty of chi/(chi-1). We also look at the spectrum of
the 1-sum (a graph operation) of two graphs\, wit
h a focus on the maximal eigenvalue.\nWe consider
a generalization of the bound for hypergraphs and
consider uniform hypergraphs for which this bound
is sharp. Finally\, we study a hypergraph operatio
n and its relation to the hypergraph bound.
LOCATION:External
CONTACT:
END:VEVENT
END:VCALENDAR