BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Is asymptotic extremal graph theory of dense graphs trivial? - Hat
 ami\, H (McGill)
DTSTART:20110614T130000Z
DTEND:20110614T140000Z
UID:TALK31744@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Recent developments in asymptotic extremal combinatorics have 
 provided powerful automatic and semi-automatic methods for proving theorem
 s in the dense setting. For example I will show how relying completely on 
 a computer\, one can solve an old conjecture of Erdos  and answer a questi
 on of Sidorenko and of Jagger\, Stovicek and Thomason.\n\nThese new discov
 eries raise the following fundamental question: ``is it possible to prove 
 every true algebraic inequalities between graph densities using a finite a
 mount of manipulation with densities of finitely many graphs?'' Although t
 his question itself is not well-defined\, various precise refinements of i
 t are formulated independently by Razborov and Lovasz. I will present a jo
 int theorem with Sergey Norin which answers many of these questions.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR