Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

DOI10.2140/moscow.2020.9.55zbMath1433.05216arXiv1905.04657OpenAlexW3007721824MaRDI QIDQ2299254

Mikhail Lavrov, József Balogh, Xujun Liu, Alexandr V. Kostochka

Publication date: 21 February 2020

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.04657

zbMATH Keywords

Ramsey numberregularity lemmapaths and cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (4)

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ An improvement on Łuczak's connected matchings method ⋮ New lower bounds on the size-Ramsey number of a path

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number for a triple of long even cycles
• The 3-colored Ramsey number of even cycles
• All Ramsey numbers for cycles in graphs
• Path-path Ramsey type numbers for the complete bipartite graph
• The Ramsey numbers for a triple of long cycles
• Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
• Three-color Ramsey numbers for paths
• On Hamilton's ideals
• Ramsey numbers for cycles in graphs
• A Ramsey-type problem in directed and bipartite graphs
• Monochromatic Cycles in 2-Coloured Graphs
• On the multi-colored Ramsey numbers of cycles
• 3‐Color bipartite Ramsey number of cycles and paths
• Tripartite Ramsey numbers for paths

This page was built for publication: Long monochromatic paths and cycles in 2-edge-colored multipartite graphs