Enomoto and Ota's conjecture holds for large graphs

Vincent Coll, Alexander Halperin, Colton Magnant +1

In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies ${\sigma }_2(G)\ge n+k-1$, then for any set of $k$ vertices $v_1,\dots ,v_k$ and for any positive integers $…