Multicolour bipartite Ramsey number of paths
From MaRDI portal
Publication:2325761
zbMath1420.05113arXiv1901.05834MaRDI QIDQ2325761
Shoham Letzter, Matija Bucić, Benjamin Sudakov
Publication date: 30 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.05834
Related Items
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The bipartite Ramsey numbers
- Improved bounds on the multicolor Ramsey numbers of paths and 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
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Multicolour Ramsey numbers of odd cycles
- Some generalized bipartite Ramsey numbers involving short cycles
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
- Three-color Ramsey numbers for paths
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- A Ramsey-type problem in directed and bipartite graphs
- Recent developments in graph Ramsey theory
