BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quantitative quasirandomness - Benny Sudakov (ETH Zurich)
DTSTART:20151105T143000Z
DTEND:20151105T153000Z
UID:TALK61158@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:A graph is quasirandom if its edge distribution is similar (in
  a well\ndefined quantitative way) to that of a random graph with the same
  edge\ndensity. Classical results of Thomason and Chung-Graham-Wilson show
 \nthat a variety of graph properties are equivalent to quasirandomness.\nO
 n the other hand\, in some known proofs the error terms which measure\nqua
 sirandomness can change quite dramatically when going from one\nproperty t
 o another which might be problematic in some applications.\n\nSimonovits a
 nd Sós proved that the property that all induced subgraphs\nhave about th
 e expected number of copies of a fixed graph H is\nquasirandom. However\, 
 their proof relies on the regularity lemma and\ngives a very weak estimate
 . They asked to find a new proof for this\nresult with a better estimate. 
 The purpose of this talk is to\naccomplish this.\n\nJoint work with D. Con
 lon and J. Fox\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR