Vu's conjecture holds for claw-free graphs

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

Given a graph $G$, let ${\Delta }_2(G)$ denote the maximum number of neighbors any two distinct vertices of $G$ have in common. Vu (2002) proposed that, provided ${\Delta }_2(G)$ is not too small…