BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The structure of large graphs - Noga Alon (Tel Aviv)
DTSTART:20090213T170000Z
DTEND:20090213T180000Z
UID:TALK16863@talks.cam.ac.uk
CONTACT:Helen Innes
DESCRIPTION:A property of graphs is hereditary if it is closed under delet
 ing vertices. Most interesting properties of graphs are hereditary\, and t
 heir study reveals some unexpected phenomena. This study combines combinat
 orial\, probabilistic\, geometric and analytic tools\, including Szemeredi
 ’s Regularity Lemma and Grothendieck’s Inequality\, and leads to inter
 esting extremal and algorithmic applications.\n\nI will survey the topic\,
  mentioning the main questions\, describing several recent results and giv
 ing a brief description of the relevant proof techniques.\n\n
LOCATION:MR2
END:VEVENT
END:VCALENDAR