Large induced distance matchings in certain sparse random graphs

Fang Tian, Yun-Qin Sun, Zi-Long Liu

For a fixed integer $k⩾2$, let $G\in \mathcal{G}(n,p)$ be a simple connected graph on $n\to \infty$ vertices with the expected degree $d=np$ satisfying $d\geqslant…