On distance edge-colourings and matchings

We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and Erdős-Rényi random graphs.