RoseMcCarty

Events Search and Views Navigation

Event Views Navigation

Today

  • Rose McCarty, Circle graphs are polynomially chi-bounded

    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.

  • Rose McCarty, Vertex-minors and flooding immersions

    Zoom ID: 869 4632 6610 (ibsdimag)

    An immersion of a graph H into a graph G sends edges of H into edge-disjoint trails of G. We say the immersion is flooding if every edge of G is in one of the trails. Flooding immersions are interesting for Eulerian group-labelled graphs; in this context they behave quite differently from regular immersions. Moreover, …

    Continue Reading
DIMAG on YouTube

We use YouTube Live to broadcast seminar talks live if the speaker agrees.