Minimal Ramsey Graphs with Many Vertices of Small Degree
From MaRDI portal
Publication:5088603
DOI10.1137/21M1393273zbMath1492.05098arXiv2009.04159OpenAlexW3083934630MaRDI QIDQ5088603
Pranshu Gupta, Dennis Clemens, Simona Boyadzhiyska
Publication date: 13 July 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.04159
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum degree of minimal Ramsey graphs for multiple colours
- What is Ramsey-equivalent to a clique?
- A new upper bound for diagonal Ramsey numbers
- On the use of senders in generalized Ramsey theory for graphs
- Ramsey-minimal graphs for star-forests
- Ramsey's theorem - a new lower bound
- Packing nearly optimal Ramsey \(R(3,t)\) graphs
- On the minimum degree of minimal Ramsey graphs
- Recent developments in graph Ramsey theory
- The minimum degree of Ramsey-minimal graphs
- On highly ramsey infinite graphs
- On Ramsey Minimal Graphs
- The structure of critical Ramsey graphs
- Threshold Functions for Ramsey Properties
- On minimal Ramsey graphs and Ramsey equivalence in multiple colours
- Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques
- Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
- Some remarks on the theory of graphs
This page was built for publication: Minimal Ramsey Graphs with Many Vertices of Small Degree
