Sophie Spirkl, Princeton University

Abstract

I will talk about a polynomial-time algorithm that decides whether a graph contains an induced cycle of odd length k > 3. Joint work with Maria Chudnovsky, Alex Scott, and Paul Seymour.