BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrew Suk (UC San Diego)
DTSTART:20220428T141500Z
DTEND:20220428T160000Z
DTSTAMP:20260424T094922Z
UID:CJCS/60
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/60/">Un
 avoidable patterns in simple topological graphs</a>\nby Andrew Suk (UC San
  Diego) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAbstrac
 t\nA simple topological graph is a graph drawn in the plane so that its ve
 rtices are represented by points\, and its edges are represented by non-se
 lf-intersecting arcs connecting the corresponding points\, with the proper
 ty that any two edges have at most one point in common.  In 2003\, Pach-So
 lymosi-Toth showed that every n-vertex complete simple topological graph c
 ontains a topological subgraph on m = Omega(\\log^{1/8} n) vertices that i
 s weakly isomorphic to the complete convex geometric graph or to the compl
 ete twisted graph on m vertices.  Here\, we improve this bound to (log n)^
 {1/4 - o(1)}.   I will also discuss other related problems as well.\nThis 
 is joint work with Ji Zeng.\n
LOCATION:https://researchseminars.org/talk/CJCS/60/
END:VEVENT
END:VCALENDAR