Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Abstract 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 …