Ramsey numbers of some bipartite graphs versus complete graphs
From MaRDI portal
Publication:659665
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
Cites work
- scientific article; zbMATH DE number 969119 (Why is no real title available?)
- A note on odd cycle-complete graph Ramsey numbers
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Asymptotic lower bounds for Ramsey functions
- Bounding Ramsey numbers through large deviation inequalities
- Coloring graphs with sparse neighborhoods
- On a class of degenerate extremal graph problems
- On cycle—Complete graph ramsey numbers
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- \(E_{11}\) and M theory
Cited in
(11)- scientific article; zbMATH DE number 7144854 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 5942217 (Why is no real title available?)
- Lower bounds for independence numbers of some locally sparse graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- scientific article; zbMATH DE number 4099362 (Why is no real title available?)
- scientific article; zbMATH DE number 3910431 (Why is no real title available?)
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
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)