BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/530
DTSTAMP:20230914T125928Z
SUMMARY:Improved Counting Relative to Pseudorandom Graphs
DESCRIPTION:Speaker: Jozef Skokan (London School of Economics\nDepartment o
f Mathematics\nHoughton Street\nLondon\, WC2A 2AE\nUnited Kingdom)\n\nAbst
ract: \nAbstract: A graph is `pseudorandom' if it appears random according
to certain statistics. Recently\, Conlon\, Fox and Zhao proved a counting
lemma\, counting small graphs in $\\varepsilon$-regular subgraphs of spar
se pseudorandom graphs. This counting lemma has many important application
s such as sparse pseudorandom analogues of Tur\\`{a}n’s Theorem\, Ramsey
’s Theorem and the graph removal lemma.\n\nOne key ingredient for the pr
oof of their counting lemma is a regularity inheritance lemma\, which stat
es that for most vertices in an $\\varepsilon$-regular subgraph of a pseud
orandom graph\, the neighbourhoods of this vertex form an $\\varepsilon’
$-regular graph. We improve this regularity inheritance lemma\, so that it
now applies to graphs with weaker pseudorandomness conditions. This impli
es an improved counting lemma relative to these pseudorandom graphs (based
on joint work with Peter Allen\, Julia Boettcher\, Maya Stein).\n
URL:https://www.tcs.tifr.res.in/web/events/530
DTSTART;TZID=Asia/Kolkata:20140814T100000
DTEND;TZID=Asia/Kolkata:20140814T110000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR