![Loading Events](https://dimag.ibs.re.kr/cms/wp-content/plugins/the-events-calendar/src/resources/images/tribe-loading.gif)
- This event has passed.
Rose McCarty, Circle graphs are polynomially chi-bounded
Friday, April 26, 2019 @ 4:00 PM - 5:00 PM KST
Room B232,
IBS (기초과학연구원)
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.