BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Lutz Warnke (Georgia Tech)
DTSTART:20210226T140000Z
DTEND:20210226T150000Z
DTSTAMP:20260423T003238Z
UID:WCS/20
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/20/">Pra
 gue dimension of random graphs</a>\nby Lutz Warnke (Georgia Tech) as part 
 of Warwick Combinatorics Seminar\n\n\nAbstract\nThe Prague dimension of gr
 aphs was introduced by Nesetril\, Pultr and Rodl in the 1970s: as a combin
 atorial measure of complexity\, it is closely related to clique edges cove
 rings and partitions. Proving a conjecture of Furedi and Kantor\, we show 
 that the Prague dimension of the binomial random graph is typically of ord
 er n/(log n) for constant edge-probabilities. \nThe main new proof ingredi
 ent is a Pippenger-Spencer type edge-coloring result for random hypergraph
 s with large uniformities\, i.e.\, edges of size O(log n). \n\nBased on jo
 int work with He Guo and Kalen Patton\, see https://arxiv.org/abs/2011.094
 59\n
LOCATION:https://researchseminars.org/talk/WCS/20/
END:VEVENT
END:VCALENDAR