BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jaehoon Kim (KAIST)
DTSTART:20200910T070000Z
DTEND:20200910T080000Z
DTSTAMP:20260513T225844Z
UID:SCMSComb/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/10/
 ">Extremal density for sparse minors and subdivisions</a>\nby Jaehoon Kim 
 (KAIST) as part of SCMS Combinatorics Seminar\n\n\nAbstract\nWe prove an a
 symptotically tight bound on the extremal density guaranteeing subdivision
 s of bounded-degree bipartite graphs with a separability condition. As cor
 ollaries\, we answered several questions of Reed and Wood on embedding spa
 rse minors. In particular\, we prove that a graph with average degree $(3/
 2+ o(1))t$ contains every $t$-vertex planar graph as a minor and this cons
 tant $3/2$ is best possible. This is joint work with John Haslegrave and 
 Hong Liu.\n\npassword 121323\n
LOCATION:https://researchseminars.org/talk/SCMSComb/10/
END:VEVENT
END:VCALENDAR