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:Combinatorics Seminar
SUMMARY:Extremal graphs and graph limits - László Lóvász (
Eötvös Loránd University)
DTSTART;TZID=Europe/London:20120525T143000
DTEND;TZID=Europe/London:20120525T153000
UID:TALK38032AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/38032
DESCRIPTION:Growing sequences of dense graphs have a limit obj
ect in terms of a symmetric measuable 2-variable f
unction. A typical use of this fact in graph theor
y is the following: we want to prove a result\, sa
y an inequality between subgraph densities. We loo
k at a sequence of\ncounterexamples\, and consider
their limit. Often this allows clean formulations
and arguments that would be awkward or impossible
in the finite setting. We illustrate this by some
results on Sidorenko's conjecture and "common gra
phs".\n\nThis setting also allows us to pose and i
n some cases answer general questions about extrem
al graph theory: which inequalities between subgra
ph densities are valid\, and what is the possible
structure of extremal graphs.\n
LOCATION:MR4
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR