BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jan Volec (Czech Technical University in Prague)
DTSTART:20200917T070000Z
DTEND:20200917T080000Z
DTSTAMP:20260423T021017Z
UID:SCMSComb/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/11/
 ">Non-bipartite k-common graphs</a>\nby Jan Volec (Czech Technical Univers
 ity in Prague) as part of SCMS Combinatorics Seminar\n\n\nAbstract\nFor a 
 given integer $k\\ge2$\, a graph H is said to be "k-common" if the number 
 of monochromatic copies of H in a k-coloring of the edges of an n-vertex c
 omplete graph is asymptotically minimized by a random coloring. Note that 
 the case $k=2$ coincides with the notion of common graphs introduced in 19
 60s.\n\nWe construct the first examples of non-bipartite k-common graphs f
 or $k\\ge3$\, which resolves a problem of Jagger\, Stovícek and Thomason 
 from 1996.\n\nThis is a joint work with Dan Kral\, Jon Noel\, Sergey Norin
  and Fan Wei.\n\npassword 121323\n
LOCATION:https://researchseminars.org/talk/SCMSComb/11/
END:VEVENT
END:VCALENDAR