3‐Color bipartite Ramsey number of cycles and paths
From MaRDI portal
Publication:3299216
DOI10.1002/JGT.22463zbMath1443.05120arXiv1803.03689OpenAlexW3098480989WikidataQ127926701 ScholiaQ127926701MaRDI QIDQ3299216
Matija Bucić, Shoham Letzter, Benjamin Sudakov
Publication date: 17 July 2020
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03689
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (10)
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ A bipartite version of the Erdős–McKay conjecture ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ An improvement on Łuczak's connected matchings method ⋮ Bipartite Ramsey numbers of cycles ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Bipartite Ramsey numbers of \(K_{t,s}\) in many colors ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs
This page was built for publication: 3‐Color bipartite Ramsey number of cycles and paths