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:20250304T163000
DTEND;TZID=Asia/Seoul:20250304T173000
DTSTAMP:20260417T070510
CREATED:20250123T112518Z
LAST-MODIFIED:20250223T142525Z
UID:10492-1741105800-1741109400@dimag.ibs.re.kr
SUMMARY:Irene Muzi\, An elementary bound for Younger's conjecture
DESCRIPTION:In 1996\, Reed\, Robertson\, Seymour and Thomas proved Younger’s Conjecture\, which states that for all directed graphs D\, there exists a function f such that if D does not contain k disjoint cycles\, D contains a feedback vertex set\, i.e. a subset of vertices whose deletion renders the graph acyclic\, of size bounded by f(k). However\, the function obtained by Reed\, Robertson\, Seymour and Thomas is enormous and\, in fact\, not even elementary. The bound had\, so far\, not been improved. In this talk\, I will present new techniques to improve the bound from non-elementary to elementary. This is joint work with Meike Hatzel\, Stephan Kreutzer and Marcelo Milani.
URL:https://dimag.ibs.re.kr/event/2025-03-04/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR