On Ramsey Numbers of Sparse Graphs

DOI10.1017/S0963548303005728zbMath1062.05099OpenAlexW2170810426MaRDI QIDQ4655905

Alexandr V. Kostochka, Benjamin Sudakov

Publication date: 8 March 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548303005728

zbMATH Keywords

asymptotic upper bound\(d\)-degenerate graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (13)

On Ramsey numbers of uniform hypergraphs with given maximum degree ⋮ On two problems in graph Ramsey theory ⋮ Tower Gaps in Multicolour Ramsey Numbers ⋮ Ordered Ramsey numbers ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ On the Ramsey number of sparse 3-graphs ⋮ On Ramsey numbers of hedgehogs ⋮ Two remarks on the Burr-Erdős conjecture ⋮ Fraternal augmentations, arrangeability and linear Ramsey numbers

This page was built for publication: On Ramsey Numbers of Sparse Graphs