Loading Events

« All Events

  • This event has passed.
:

Rose McCarty, Circle graphs are polynomially chi-bounded

April 26 Friday @ 4:00 PM - 5:00 PM

Room B232, IBS (기초과학연구원)

Speaker

Rose McCarty
Department of Combinatorics and Optimization, University of Waterloo, Canada
http://www.math.uwaterloo.ca/~rmmccart/

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.

Details

Date:
April 26 Friday
Time:
4:00 PM - 5:00 PM
Event Category:
Event Tags:

Venue

Room B232
IBS (기초과학연구원)

Organizer

Sang-il Oum