Yufen Wang

Counterexamples to the Henning--Yeo Conjecture: Unbounded Fixed-Degree Gaps and Sharp First-Order Asymptotics

Henning and Yeo conjectured an upper bound on the identifying vertex cover number of a graph in terms of its order, size, and maximum degree. A two-parameter family $H_{t,r}$ of connected diameter-two graphs disproves the bound for every maximum degree at least four; after denominators are cleared, its margin is exactl...