A matching
in a graph
is
connected if all the edges of
are in the same component of
. Following Łuczak, there have been many results using the existence of large connected matchings in cluster graphs with respect to regular partitions of large graphs to show the existence of long paths and other structures in these graphs. We prove exact Ramsey‐type bounds on the...