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

DOI10.1137/21M1444953WikidataQ122660169 ScholiaQ122660169MaRDI QIDQ5883271FDOQ5883271

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

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

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)

Cites Work

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

Cited In (2)

• On the use of senders for asymmetric tuples of cliques in Ramsey theory
• Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques

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)