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:Is asymptotic extremal graph theory of dense graph
s trivial? - Hatami\, H (McGill)
DTSTART;TZID=Europe/London:20110614T140000
DTEND;TZID=Europe/London:20110614T150000
UID:TALK31744AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/31744
DESCRIPTION:Recent developments in asymptotic extremal combina
torics have provided powerful automatic and semi-a
utomatic methods for proving theorems in the dense
setting. For example I will show how relying comp
letely on a computer\, one can solve an old conjec
ture of Erdos and answer a question of Sidorenko
and of Jagger\, Stovicek and Thomason.\n\nThese ne
w discoveries raise the following fundamental ques
tion: ``is it possible to prove every true algebra
ic inequalities between graph densities using a fi
nite amount of manipulation with densities of fini
tely many graphs?'' Although this question itself
is not well-defined\, various precise refinements
of it are formulated independently by Razborov and
Lovasz. I will present a joint theorem with Serge
y Norin which answers many of these questions.\n\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR