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:20251014T163000
DTEND;TZID=Asia/Seoul:20251014T173000
DTSTAMP:20260416T124331
CREATED:20250918T011807Z
LAST-MODIFIED:20250918T014049Z
UID:11604-1760459400-1760463000@dimag.ibs.re.kr
SUMMARY:Ilkyoo Choi (최일규)\, An improved lower bound on the number of edges in list critical graphs via DP coloring
DESCRIPTION:A graph $G$ is (list\, DP) $k$-critical if the (list\, DP) chromatic number is $k$ but for every proper subgraph $G’$ of $G$\, the (list\, DP) chromatic number of $G’$ is less than $k$. For $k\geq 4$\, we show a bound on the minimum number of edges in a DP $k$-critical graph\, and our bound is the first bound that is asymptotically better than the corresponding bound for proper $k$-critical graphs by Gallai from 1963. Our result also improves the best bound on the list chromatic number. This is joint work with Bradshaw\, Kostochka\, and Xu.
URL:https://dimag.ibs.re.kr/event/2025-10-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR