On graphs with small Ramsey numbers. II.
From MaRDI portal
Publication:558242
DOI10.1007/S00493-004-0024-9zbMATH Open1063.05101OpenAlexW2053063933MaRDI QIDQ558242FDOQ558242
Authors: Alexandr Kostochka, Vojtěch Rödl
Publication date: 5 July 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0024-9
Recommendations
Cited In (13)
- On the Ramsey number of sparse 3-graphs
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Two remarks on the Burr-Erdős conjecture
- Dependent random choice
- A Folkman linear family
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Linear Ramsey numbers of sparse graphs
- The Ramsey number of a graph with bounded maximum degree
- A conjecture of Erdős on graph Ramsey numbers
- Hypergraph packing and sparse bipartite Ramsey numbers
- Anti-Ramsey numbers of small graphs.
- Ramsey numbers of degenerate graphs
- Ordered Ramsey numbers
This page was built for publication: On graphs with small Ramsey numbers. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558242)