Rose McCarty, Circle graphs are polynomially chi-bounded

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². Joint with James Davies.