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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230509T163000
DTEND;TZID=Asia/Seoul:20230509T173000
DTSTAMP:20260419T080043
CREATED:20230413T233653Z
LAST-MODIFIED:20240707T073713Z
UID:7041-1683649800-1683653400@dimag.ibs.re.kr
SUMMARY:Jozef Skokan\, Separating the edges of a graph by a linear number of paths
DESCRIPTION:Recently\, Letzter proved that any graph of order n contains a collection P of $O(n \log^*n)$ paths with the following property: for all distinct edges e and f there exists a path in P which contains e but not f. We improve this upper bound to 19n\, thus answering a question of Katona and confirming a conjecture independently posed by Balogh\, Csaba\, Martin\, and Pluhar and by Falgas-Ravry\, Kittipassorn\, Korandi\, Letzter\, and Narayanan. \nOur proof is elementary and self-contained.
URL:https://dimag.ibs.re.kr/event/2023-05-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR