Bipartite Ramsey numbers for graphs of small bandwidth
From MaRDI portal
Publication:1753090
zbMath1391.05181MaRDI QIDQ1753090
Lili Shen, Qizhong Lin, Qinghai Liu
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p16
Related Items (5)
Graph partitioning: an updated survey ⋮ Bipartite Ramsey numbers of cycles ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Bipartite Ramsey numbers of paths for random graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The bipartite Ramsey numbers
- Bipartite Ramsey numbers involving large \(K_{n,n}\)
- On finite Ramsey numbers
- Ramsey's theorem - a new lower bound
- Path-path Ramsey type numbers for the complete bipartite graph
- \(K_{2,2}\)-\(K_{1,n}\) and \(K_{2,n}\)-\(K_{2,n}\) bipartite Ramsey numbers
- Ramsey numbers for bipartite graphs with small bandwidth
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- Embedding into Bipartite Graphs
- Recent developments in graph Ramsey theory
- A Folkman Linear Family
- A new upper bound for the bipartite Ramsey problem
- An extremal problem for paths in bipartite graphs
- On sets of integers containing k elements in arithmetic progression
- A bipartite Ramsey problem and the Zarankiewicz numbers
- On Certain Sets of Integers
- On Certain Sets of Integers (II)
- Asymptotic bounds for bipartite Ramsey numbers
This page was built for publication: Bipartite Ramsey numbers for graphs of small bandwidth