Linda Cook

collaborators

2 papers

math.CO2025

Vu's conjecture holds for claw-free graphs

Linda Cook, Ross J. Kang, Eileen Robinson +1

Given a graph $G$ , let $I^_{2} (G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided $I^_{2} (G)$ is not too smal…

math.CO2024

Excluding the fork and antifork

Maria Chudnovsky, Linda Cook, Paul Seymour

The fork is the tree obtained from the claw $K_{1, 3}$ by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs t…