A new upper bound for the bipartite Ramsey problem
From MaRDI portal
Publication:3630838
DOI10.1002/jgt.20317zbMath1171.05368OpenAlexW4236282724MaRDI QIDQ3630838
Publication date: 4 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20317
Related Items (17)
A Folkman Linear Family ⋮ The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs ⋮ Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) ⋮ Graph classes with linear Ramsey numbers ⋮ A bipartite version of the Erdős–McKay conjecture ⋮ Extremal bipartite independence number and balanced coloring ⋮ Complete bipartite graphs without small rainbow subgraphs ⋮ Bipartite Ramsey numbers of cycles ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ On a theorem of Razborov ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) ⋮ Blowup Ramsey numbers ⋮ Multicolor bipartite Ramsey number of C4 and large Kn, n ⋮ Bipartite Ramsey numbers of \(K_{t,s}\) in many colors ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ Ramsey numbers for partially-ordered sets
Cites Work
This page was built for publication: A new upper bound for the bipartite Ramsey problem
