Small $\ell$-edge-covers in $k$-connected graphs

Zeev Nutov

Let $G=(V,E)$ be a $k$-edge-connected graph with edge costs $\{c(e):e\in E\}$ and let $1\le \ell \le k-1$. We show by a simple and short proof, that $G$ contains an $\ell$-edge…