Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
复制标题
2边彩色多部分图中的单色连通匹配
作者：
J. Balogh;A. Kostochka;Mikhail Lavrov;Xujun Liu
图G$ G$中匹配的M$ M$是连通的，如果M$ M$的所有边都在G$ G$的同一分量中。在Łuczak之后，已经有许多结果使用聚类图中关于大图的规则分区的大连接匹配的存在来显示这些图中长路径和其他结构的存在。我们证明了2边彩色多部图中单色连通匹配大小的精确Ramsey型界。此外，我们还证明了这种匹配的稳定性定理。
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.
2 边彩色多部分图中的长单色路径和循环
影响因子：
--
作者：
Balogh, József;Kostochka, Alexandr;Lavrov, Mikhail;Liu, Xujun
通讯作者：
Liu, Xujun