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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250829T163000
DTEND;TZID=Asia/Seoul:20250829T173000
DTSTAMP:20260416T160803
CREATED:20250813T120105Z
LAST-MODIFIED:20250813T122838Z
UID:11368-1756485000-1756488600@dimag.ibs.re.kr
SUMMARY:Sang-il Oum (엄상일)\, The Erdős-Pósa property for circle graphs as vertex-minors
DESCRIPTION:We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$\, there exists an integer $t=t(k\,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$\, or has a $t$-perturbation with no vertex-minor isomorphic to $H$. Using the same techniques\, we also prove that for any planar multigraph $H$\, every binary matroid either has a minor isomorphic to the cycle matroid of $kH$\, or is a low-rank perturbation of a binary matroid with no minor isomorphic to the cycle matroid of $H$. This is joint work with Rutger Campbell\, J. Pascal Gollin\, Meike Hatzel\, O-joung Kwon\, Rose McCarty\, and Sebastian Wiederrecht.
URL:https://dimag.ibs.re.kr/event/2025-08-29/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR