On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles

DOI10.1137/21M1444953WikidataQ122660169 ScholiaQ122660169MaRDI QIDQ5883271

Pranshu Gupta, Unnamed Author, Anurag Bishnoi, Anita Liebenau, Dennis Clemens, Simona Boyadzhiyska

Publication date: 30 March 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.02877

zbMATH Keywords

cyclesRamsey theoryminimum degreecliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• 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?
• Hypergraph containers
• A new upper bound for diagonal Ramsey numbers
• Small subsets inherit sparse \(\varepsilon\)-regularity
• A note on the independence number of triangle-free graphs
• On the use of senders in generalized Ramsey theory for graphs
• A note on Ramsey numbers
• Ramsey-minimal graphs for forests
• All Ramsey numbers for cycles in graphs
• Ramsey's theorem - a new lower bound
• On \(K^ 4\)-free subgraphs of random graphs
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• On the minimum degree of minimal Ramsey graphs
• The minimum degree of Ramsey-minimal graphs
• On highly ramsey infinite graphs
• On Ramsey Minimal Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Induced Size-Ramsey Number of Cycles
• Minimal Ramsey Graphs with Many Vertices of Small Degree
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Independent sets in hypergraphs
• Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques
• A Short Proof of the Random Ramsey Theorem
• Path Ramsey Number for Random Graphs
• Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
• On chromatic number of graphs and set-systems
• Some remarks on the theory of graphs
• Dynamic concentration of the triangle‐free process

This page was built for publication: On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles