The minimum degree of Ramsey-minimal graphs
From MaRDI portal
Publication:3422133
DOI10.1002/jgt.20199zbMath1109.05077OpenAlexW4248191427MaRDI QIDQ3422133
Publication date: 9 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20199
Related Items (13)
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Small minimal $(3, 3)$-Ramsey graphs ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ On globally sparse Ramsey graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ What is Ramsey-equivalent to a clique? ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques
This page was built for publication: The minimum degree of Ramsey-minimal graphs