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:Combinatorics Seminar
SUMMARY:Quantitative quasirandomness - Benny Sudakov (ETH
Zurich)
DTSTART;TZID=Europe/London:20151105T143000
DTEND;TZID=Europe/London:20151105T153000
UID:TALK61158AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/61158
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-W
ilson show\nthat a variety of graph properties are
equivalent to quasirandomness.\nOn the other hand
\, in some known proofs the error terms which meas
ure\nquasirandomness can change quite dramatically
when going from one\nproperty to another which mi
ght be problematic in some applications.\n\nSimono
vits and Sós proved that the property that all ind
uced subgraphs\nhave about the 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. Conlon and J. Fox\n
LOCATION:MR12
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR