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

DOI10.1137/21M1444953MaRDI QIDQ5883271zbMATH OpenWikidataFDO

Authors Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Anita Liebenau

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

minimum degreeRamsey theorycyclescliques

Mathematics Subject Classification ID

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

Recommendations

• The minimum degree of minimal Ramsey graphs for cliques
• Minimum degrees of minimal Ramsey graphs for almost-cliques
• On the minimum degree of minimal Ramsey graphs
• The minimum degree of Ramsey-minimal graphs
• On Ramsey minimal graphs
• On Ramsey minimal graphs
• On Ramsey Minimal Graphs
• On Ramsey \((K_{1,2}, K_n)\)-minimal graphs
• On the minimum degree of minimal Ramsey graphs for multiple colours
• On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs

Cites work

• scientific article; zbMATH DE number 3665001 (Why is no real title available?)
• scientific article; zbMATH DE number 3520447 (Why is no real title available?)
• scientific article; zbMATH DE number 3545699 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• A new upper bound for diagonal Ramsey numbers
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs
• A short proof of the random Ramsey theorem
• All Ramsey numbers for cycles in graphs
• Dynamic concentration of the triangle‐free process
• Hypergraph containers
• Independent sets in hypergraphs
• Minimal Ramsey graphs with many vertices of small degree
• Minimum degrees of minimal Ramsey graphs for almost-cliques
• Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite
• On Ramsey Minimal Graphs
• On \(K^ 4\)-free subgraphs of random graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• On chromatic number of graphs and set-systems
• On highly ramsey infinite graphs
• On the minimum degree of minimal Ramsey graphs
• On the minimum degree of minimal Ramsey graphs for multiple colours
• On the use of senders in generalized Ramsey theory for graphs
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• Path Ramsey number for random graphs
• Ramsey's theorem - a new lower bound
• Ramsey-minimal graphs for forests
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Some remarks on the theory of graphs
• The Induced Size-Ramsey Number of Cycles
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The minimum degree of Ramsey-minimal graphs
• The sparse regularity lemma and its applications
• The triangle-free process and the Ramsey number \(R(3,k)\)
• Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
• What is Ramsey-equivalent to a clique?

Cited in

(4)

• Minimal Ramsey graphs with many vertices of small degree
• On the use of senders for asymmetric tuples of cliques in Ramsey theory
• Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
• On the minimum degree of minimal Ramsey graphs for cliques versus cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883271)