BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Kevin Hendrey (IBS)
DTSTART:20200827T070000Z
DTEND:20200827T080000Z
DTSTAMP:20260423T021018Z
UID:SCMSComb/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/13/
 ">Counting cliques in 1-planar graphs</a>\nby Kevin Hendrey (IBS) as part 
 of SCMS Combinatorics Seminar\n\n\nAbstract\nA 1-planar graph is a graph w
 hich can be drawn in the plane so that every edge is crossed at most once.
  It is well known that the maximum number of edges in a 1-planar graph is 
 4n-8. It is natural consider extending this result to larger cliques. We p
 recisely determine the maximum number of cliques of any given size in a 1-
 planar graph\, and also determine the family of 1-planar graphs which are 
 extremal for this question. This is joint work with Pascal Gollin\, Abhish
 ek Methuku\, Casey Tompkins and Xin Zhang.\n\npassword 121323\n
LOCATION:https://researchseminars.org/talk/SCMSComb/13/
END:VEVENT
END:VCALENDAR