Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth

DOI10.1137/18M1179420zbMath1403.05096arXiv1804.02451OpenAlexW2963737636MaRDI QIDQ4611005

Guilherme Oliveira Mota

Publication date: 23 January 2019

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

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

zbMATH Keywords

bandwidthregularity lemmabipartite Ramsey number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bipartite Ramsey numbers
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number for a triple of long even cycles
• Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
• The 3-colored Ramsey number of even cycles
• On finite Ramsey numbers
• All Ramsey numbers for cycles in graphs
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Blow-up lemma
• Small Ramsey numbers
• Path Ramsey numbers in multicolorings
• Ramsey numbers for trees of small maximum degree
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Ramsey numbers for bipartite graphs with small bandwidth
• Three-color Ramsey numbers for paths
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• A Ramsey-type problem in directed and bipartite graphs
• Ramsey functions involving \(K_{m,n}\) with \(n\) large
• Embedding into Bipartite Graphs
• Recent developments in graph Ramsey theory
• 3‐Color bipartite Ramsey number of cycles and paths
• Tripartite Ramsey numbers for paths
• A new upper bound for the bipartite Ramsey problem
• An algorithmic version of the blow-up lemma
• Hypergraph Packing and Graph Embedding

This page was built for publication: Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth