Ramsey numbers of some bipartite graphs versus complete graphs
From MaRDI portal
Publication:659665
DOI10.1007/S00373-010-0959-0zbMATH Open1234.05161OpenAlexW2002645285MaRDI QIDQ659665FDOQ659665
Authors: Tao Jiang, M. Salerno 
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0959-0
Recommendations
- scientific article; zbMATH DE number 4099362
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- Bipartite Ramsey numbers involving large \(K_{n,n}\)
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- \(E_{11}\) and M theory
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Asymptotic lower bounds for Ramsey functions
- Title not available (Why is that?)
- Coloring graphs with sparse neighborhoods
- On cycle—Complete graph ramsey numbers
- Bounding Ramsey numbers through large deviation inequalities
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- A note on odd cycle-complete graph Ramsey numbers
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- On a class of degenerate extremal graph problems
Cited In (11)
- Extremal theory and bipartite graph-tree Ramsey numbers
- Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Multicolor Ramsey numbers for complete bipartite versus complete graphs
- Title not available (Why is that?)
- Lower bounds for independence numbers of some locally sparse graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Title not available (Why is that?)
- Title not available (Why is that?)
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Title not available (Why is that?)
This page was built for publication: Ramsey numbers of some bipartite graphs versus complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659665)
