Long monochromatic paths and cycles in 2-colored bipartite graphs

DOI10.1016/j.disc.2020.111907zbMath1441.05072arXiv1806.05119OpenAlexW3013984945MaRDI QIDQ2185910

Robert A. Krueger, Louis DeBiasio

Publication date: 8 June 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

stabilityconnected matching

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (3)

Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ Monochromatic components in edge-coloured graphs with large minimum degree ⋮ Large monochromatic components in almost complete graphs and bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of the path-path Ramsey number
• Path-path Ramsey type numbers for the complete bipartite graph
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Generalizing the Ramsey problem through diameter
• A Ramsey-type problem in directed and bipartite graphs
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• Highly connected monochromatic subgraphs of multicolored graphs
• Embedding large subgraphs into dense graphs
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs

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