BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260310T163000
DTEND;TZID=Asia/Seoul:20260310T173000
DTSTAMP:20260417T234122
CREATED:20251018T001247Z
LAST-MODIFIED:20260310T112956Z
UID:11743-1773160200-1773163800@dimag.ibs.re.kr
SUMMARY:Dario Cavallaro\, Well-quasi-ordering Eulerian directed graphs by (strong) immersion
DESCRIPTION:Directed graphs prove to be very hard to tame in contrast to undirected graphs. In particular\, they are not well-quasi-ordered by any known relevant inclusion relation\, and are lacking fruitful structure theorems. This motivates the search for structurally rich subclasses of directed graphs that are well behaved. Eulerian directed graphs are a particularly prominent example\, sharing many similarities with undirected graphs. In fact\, it is conjectured that Eulerian directed graphs are well-quasi-ordered by weak immersion\, and even well-quasi-ordered by strong immersion when restricting to classes of bounded degree. We believe that we have a proof of both conjectures\, and I will report on the current status\, progress\, and steps towards said proof and its implications. This is joint work with Ken-ichi Kawarabayashi and Stephan Kreutzer.
URL:https://dimag.ibs.re.kr/event/2026-03-10/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR