Bipartite Ramsey numbers involving large \(K_{n,n}\)
From MaRDI portal
Publication:1024286
DOI10.1016/j.ejc.2008.07.019zbMath1180.05072OpenAlexW2020254103MaRDI QIDQ1024286
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.019
Related Items (5)
Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) ⋮ Extremal bipartite independence number and balanced coloring ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- On finite Ramsey numbers
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On size Ramsey number of paths, trees, and circuits. I
- An Upper Bound on Zarankiewicz' Problem
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On a problem of K. Zarankiewicz
- Asymptotic bounds for bipartite Ramsey numbers
This page was built for publication: Bipartite Ramsey numbers involving large \(K_{n,n}\)
