BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210512T170000
DTEND;TZID=Asia/Seoul:20210512T180000
DTSTAMP:20260420T111956
CREATED:20210319T045925Z
LAST-MODIFIED:20240705T190026Z
UID:3816-1620838800-1620842400@dimag.ibs.re.kr
SUMMARY:Johannes Carmesin\, A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings
DESCRIPTION:Given a graph\, how do we construct a surface so that the graph embeds in that surface in an optimal way? Thomassen showed that for minimum genus as optimality criterion\, this problem would be NP-hard. Instead of minimum genus\, here we use local planarity — and provide a polynomial algorithm. \nOur embedding method is based on Whitney’s trick to use matroids to construct embeddings in the plane. Consequently we obtain a characterisation of the graphs admitting locally planar embeddings in surfaces in terms of a certain matroid being co-graphic.
URL:https://dimag.ibs.re.kr/event/2021-05-12/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR