The minimum degree of minimal Ramsey graphs for cliques
From MaRDI portal
Publication:6048881
DOI10.1112/blms.12658zbMath1521.05113arXiv2008.02474OpenAlexW3047480355MaRDI QIDQ6048881
John Bamberg, Unnamed Author, Anurag Bishnoi
Publication date: 15 September 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02474
Extremal problems in graph theory (05C35) Generalized quadrangles and generalized polygons in finite geometry (51E12) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum degree of minimal Ramsey graphs for multiple colours
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- A new upper bound for diagonal Ramsey numbers
- Finite generalized quadrangles
- On the use of senders in generalized Ramsey theory for graphs
- Ramsey-minimal graphs for star-forests
- Generalized quadrangles associated with \(G_ 2(\)q)
- Ramsey's theorem - a new lower bound
- Packing nearly optimal Ramsey \(R(3,t)\) graphs
- Hypergraph Ramsey numbers: triangles versus cliques
- Degree Ramsey numbers for even cycles
- On the Turán number for the hexagon
- Explicit theorems on generator polynomials
- Recent developments in graph Ramsey theory
- CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS
- On Ramsey Minimal Graphs
- Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
- Some remarks on the theory of graphs
- On Ramsey minimal graphs
- Diagonal Ramsey via effective quasirandomness
This page was built for publication: The minimum degree of minimal Ramsey graphs for cliques
