A conjecture of Erdős on graph Ramsey numbers
From MaRDI portal
Publication:531812
DOI10.1016/j.aim.2011.02.004zbMath1213.05178arXiv1002.0095OpenAlexW2121456457WikidataQ123109593 ScholiaQ123109593MaRDI QIDQ531812
Publication date: 20 April 2011
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0095
Related Items
On two problems in graph Ramsey theory, Ramsey numbers with prescribed rate of growth, Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz, Short Proofs of Some Extremal Results, Erdős-Hajnal-type theorems in hypergraphs, On the multicolor Ramsey number of a graph with \(m\) edges, Short proofs of some extremal results III
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two problems in graph Ramsey theory
- On graphs with small Ramsey numbers. II.
- A new upper bound for diagonal Ramsey numbers
- The Ramsey number of a graph with bounded maximum degree
- Density theorems for bipartite graphs and related Ramsey-type results
- Two remarks on the Burr-Erdős conjecture
- On a Ramsey type theorem
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- On graphs with linear Ramsey numbers
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On Ramsey Numbers of Sparse Graphs
- Some remarks on the theory of graphs
- Induced Ramsey-type theorems
- On bipartite graphs with linear Ramsey numbers
