BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jonathan Noel (University of Victoria)
DTSTART:20200928T140000Z
DTEND:20200928T150000Z
DTSTAMP:20260423T035542Z
UID:EPC/30
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/30/">Non
 -bipartite k-common graphs</a>\nby Jonathan Noel (University of Victoria) 
 as part of Extremal and probabilistic combinatorics webinar\n\n\nAbstract\
 nHow many monochromatic copies of H must appear in a k-edge colouring of a
  large complete graph? The graph H is said to be "k-common" if the number 
 of monochromatic H is asymptotically minimized by a random colouring. Rece
 nt progress on Sidorenko's Conjecture has provided many new examples of bi
 partite k-common graphs\; however\, it is not known if such graphs can hav
 e high chromatic number. We construct the first examples of non-bipartite 
 k-common graphs for $k \\ge 3$\, addressing a problem raised by Jagger\, 
 Šťovíček and Thomason in 1996. This talk is based on joint work with D
 aniel Kráľ\, Sergey Norin\, Jan Volec and Fan Wei.\n
LOCATION:https://researchseminars.org/talk/EPC/30/
END:VEVENT
END:VCALENDAR