Li–Li edge-connection conjecture

Let $G$ be a $k$-edge-connected graph, where $k\ge 2$, and let $H\subset G$ be a minimum-edge spanning $k$-edge-connected subgraph, meaning a spanning $k$-edge-connected subgraph with minimum $e(H)$. Li–Li edge-connection conjecture.

$$emc_k(G)=e(G)-e(H)+\left\lfloor\frac{k}{2}\right\rfloor.$$

This is presented as the edge-connectivity analogue of the paper's monochromatic $k$-connection conjecture.