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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20190426T160000
DTEND;TZID=Asia/Seoul:20190426T170000
DTSTAMP:20260423T123747
CREATED:20190309T122202Z
LAST-MODIFIED:20240705T211023Z
UID:666-1556294400-1556298000@dimag.ibs.re.kr
SUMMARY:Rose McCarty\, Circle graphs are polynomially chi-bounded
DESCRIPTION:Circle graphs are the intersection graphs of chords on a circle; vertices correspond to chords\, and two vertices are adjacent if their chords intersect. We prove that every circle graph with clique number k has chromatic number at most $4k^2$. Joint with James Davies.
URL:https://dimag.ibs.re.kr/event/2019-04-26/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR