BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Shoham Letzter (University College London)
DTSTART:20200720T130000Z
DTEND:20200720T140000Z
DTSTAMP:20260423T021129Z
UID:EPC/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/15/">Mon
 ochromatic triangle packings in 2-coloured complete graphs</a>\nby Shoham 
 Letzter (University College London) as part of Extremal and probabilistic 
 combinatorics webinar\n\n\nAbstract\nAbstract: We show that every 2-colour
 ed complete graph on n vertices contains $n^2/12 + o(n^2)$ pairwise edge-d
 isjoint monochromatic triangles. This confirms a conjecture of Erdős\, an
 d is asymptotically tight. This is joint work with Vytautas Gruslys.\n
LOCATION:https://researchseminars.org/talk/EPC/15/
END:VEVENT
END:VCALENDAR