BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:An Approximate Form of Sidorenko's Conjecture - David Conlon (St J
 ohn's College\, Cambridge)
DTSTART:20110203T150000Z
DTEND:20110203T160000Z
UID:TALK29673@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:A beautiful conjecture of Erdos-Simonovits and Sidorenko state
 s that if H is a bipartite graph\, then the random graph with edge density
  p has in expectation asymptotically the minimum number of copies of H ove
 r all\ngraphs of the same order and edge density. Here we prove the conjec
 ture if H has a vertex complete to the other part\, and deduce an approxim
 ate version of the conjecture for all H. Furthermore\, for a large class o
 f\nbipartite graphs\, we prove a stronger stability result which answers a
  question of Chung\, Graham\, and Wilson on quasirandomness for these grap
 hs.\n\nJoint work with Jacob Fox and Benny Sudakov.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR