BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Turán densities for hypergraph with quasirandom li
nks - Simón Piga\, University of Birmingham
DTSTART:20220526T140000Z
DTEND:20220526T150000Z
UID:TALK4911AT
URL:/talk/index/4911
DESCRIPTION:Reiher\, Rödl\, and Schacht proved that 3-uniform
hypergraphs with the property that all vertices ha
ve a quasirandom link graph with density bigger th
an $(r-2)/(r-3)$ contain a clique on $2^r$ vertice
s. This result turned out to be asymptotically bes
t possible for several cliques up to size 16. Thei
r proof is based on an application of the regulari
ty method for hypergraphs. Here we find a substant
ially simpler proof of this result based mainly on
supersaturation arguments. In fact this new appro
ach allows us to obtain slightly more general resu
lts.\n\nAdditionally\, for the appropriately defin
ed Turán density for this context\, we establish a
general bound for the Turán density of $K_{2r}$ w
ith respect to the Turán density of $K_r$. This is
a joint work with Berger\, Reiher\, Rödl\, and Sc
hacht.
LOCATION:Poynting Large Lecture Theatre. Also via Zoom link
: https://bham-ac-uk.zoom.us/j/88168768618
CONTACT:Eoin Long
END:VEVENT
END:VCALENDAR