On the minimum degree of minimal Ramsey graphs

DOI10.1002/JGT.20445zbMath1209.05151DBLPjournals/jgt/SzaboZZ10OpenAlexW4253985608WikidataQ56475798 ScholiaQ56475798MaRDI QIDQ3055912

Philipp Zumstein, Stefanie Zürcher, Tibor Szabó

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://madoc.bib.uni-mannheim.de/41425/1/revised-final.pdf

zbMATH Keywords

Ramsey theoryminimum degreeminimal Ramsey graphsRamsey-equivalentRamsey-seperable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (14)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\) ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ On globally sparse Ramsey graphs ⋮ Chromatic number is Ramsey distinguishing ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ What is Ramsey-equivalent to a clique? ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ Minimal ordered Ramsey graphs ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques

Cites Work

• Unnamed Item

This page was built for publication: On the minimum degree of minimal Ramsey graphs