On graphs with small Ramsey numbers*
From MaRDI portal
Publication:2746201
DOI10.1002/jgt.1014zbMath0994.05094OpenAlexW2528484107MaRDI QIDQ2746201
Vojtěch Rödl, Alexandr V. Kostochka
Publication date: 1 October 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1014
Related Items (22)
On explicit constructions of designs ⋮ A Folkman Linear Family ⋮ On Ramsey numbers of uniform hypergraphs with given maximum degree ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ The tail is cut for Ramsey numbers of cubes ⋮ Two extensions of Ramsey's theorem ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ A few remarks on Ramsey--Turán-type problems ⋮ On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ Ramsey numbers of cubes versus cliques ⋮ Unavoidable patterns ⋮ When is an Almost MonochromaticK4Guaranteed? ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ Size bipartite Ramsey numbers ⋮ On large intersecting subfamilies of uniform setfamilies ⋮ On the Ramsey number of sparse 3-graphs ⋮ Two remarks on the Burr-Erdős conjecture ⋮ Fraternal augmentations, arrangeability and linear Ramsey numbers
Cites Work
This page was built for publication: On graphs with small Ramsey numbers*
