Ramsey numbers involving large dense graphs and bipartite Turán numbers
From MaRDI portal
Publication:1405120
DOI10.1016/S0095-8956(02)00011-4zbMath1031.05085MaRDI QIDQ1405120
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Ramsey numbers of \(K_3\) and \(K_{n,n}\), Ramsey numbers of some bipartite graphs versus complete graphs, Ramsey numbers involving graphs with large degrees, Bipartite Ramsey numbers involving large \(K_{n,n}\), Independence numbers of hypergraphs with sparse neighborhoods.
Cites Work
- A Ramsey problem of Harary on graphs with prescribed size
- Asymptotic lower bounds for Ramsey functions
- New asymptotics for bipartite Turán numbers
- On book-complete graph Ramsey numbers
- Norm-graphs and bipartite Turán numbers
- On maximal paths and circuits of graphs
- Bounding Ramsey numbers through large deviation inequalities
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On Graphs that do not Contain a Thomsen Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item