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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250916T163000
DTEND;TZID=Asia/Seoul:20250916T173000
DTSTAMP:20260416T143325
CREATED:20250822T095250Z
LAST-MODIFIED:20250822T095250Z
UID:11440-1758040200-1758043800@dimag.ibs.re.kr
SUMMARY:Mujin Choi (최무진)\, Excluding ladder and wheel as induced minor in graphs without induced stars
DESCRIPTION:We prove that for all positive integers $k$ and $d$\, the class of $K_{1\,d}$-free graphs not containing the $k$-ladder or the $k$-wheel as an induced minor has a bounded tree-independence number. Our proof uses a generalization of the concept of brambles to tree-independence number. This is based on joint work with Claire Hilaire\, Martin Milanič\, and Sebastian Wiederrecht.
URL:https://dimag.ibs.re.kr/event/2025-09-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR