Bipartite Ramsey numbers involving large K_n,n
From MaRDI portal
Publication:1024286
DOI10.1016/J.EJC.2008.07.019zbMATH Open1180.05072OpenAlexW2020254103MaRDI QIDQ1024286FDOQ1024286
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On size Ramsey number of paths, trees, and circuits. I
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On a problem of K. Zarankiewicz
- On finite Ramsey numbers
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- An Upper Bound on Zarankiewicz' Problem
- Asymptotic bounds for bipartite Ramsey numbers
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Title not available (Why is that?)
Cited In (8)
- The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
- Bipartite Ramsey numbers of \(K_{t,s}\) in many colors
- Multicolor bipartite Ramsey number of C4 and large Kn, n
- On graphs with small Ramsey numbers
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- Extremal bipartite independence number and balanced coloring
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- Bipartite Ramsey numbers for graphs of small bandwidth
This page was built for publication: Bipartite Ramsey numbers involving large \(K_{n,n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024286)
