On August 17, 2021, Linda Cook from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on (1) a polynomial-time algorithm to detect long even holes and (2) a structure of graphs with no holes of length≠𝓁 for a fixed 𝓁≥7. The title of her talk was “Two results on graphs with holes of restricted lengths“.
The IBS discrete mathematics group welcomes Dr. Linda Cook, a new research fellow at the IBS discrete mathematics group from August 1, 2021. She received her Ph.D. from the Program in Applied and Computational Mathematics at Princeton University under the supervision of Prof. Paul Seymour. She is interested in structural graph theory and its algorithmic applications.