The maximum removable matching conjecture in k-connected graphs

Let $G$ be a $k$-connected graph on $n$ vertices with minimum degree $\delta(G)\ge k+2$. A matching is $k$-removable when deleting its edges leaves a $k$-connected graph. The maximum removable matching conjecture. The graph $G$ contains a $k$-removable matching of size $\min\{\lfloor n/2\rfloor,\delta(G)\}$. This conjecture concerns the largest matching size permitted by the order of the graph and the minimum-degree bound. The supplied context gives no resolution or partial status for it, so it remains open.