Monochromatic connected matchings in 2‐edge‐colored multipartite graphs

A matching M $M$ in a graph G $G$ is connected if all the edges of M $M$ are in the same component of G $G$ . 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 sizes of monochromatic connected matchings in 2‐edge‐colored multipartite graphs. In addition, we prove a stability theorem for such matchings.