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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2022-07, Vol.100 (3), p.578-607
Hauptverfasser:	Balogh, József, Kostochka, Alexandr, Lavrov, Mikhail, Liu, Xujun
Format:	Artikel
Sprache:	eng
Schlagworte:	connected matchings Graph coloring Graph theory Graphs paths Ramsey theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!