Short paths in -regular pairs and small diameter decompositions of dense graphs

In this paper we give optimal vertex degree conditions that guarantee connection by short paths in ε -regular bipartite graphs. We also study a related question of decomposing an arbitrary graph into subgraphs of small diameter.