On the minimum degree of minimal Ramsey graphs for multiple colours

DOI10.1016/j.jctb.2016.03.006zbMath1337.05076arXiv1502.02881MaRDI QIDQ290809

Jacob Fox, Tibor Szabó, Andrey Grinshpun, Yury Person, Anita Liebenau

Publication date: 3 June 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryminimum degreeErdős-Rogers functionminimal Ramsey graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

05C07: Vertex degrees

Related Items

On minimal Ramsey graphs and Ramsey equivalence in multiple colours, Minimal Ramsey Graphs with Many Vertices of Small Degree, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles, The minimum degree of minimal Ramsey graphs for cliques, Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs, What is Ramsey-equivalent to a clique?, Saturation numbers for Ramsey-minimal graphs, Two problems in graph Ramsey theory, Packing nearly optimal Ramsey \(R(3,t)\) graphs, On Ramsey-minimal infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized Ramsey numbers of Erdős and Rogers
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• A new upper bound for diagonal Ramsey numbers
• The triangle-free process
• 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
• Graphs without large triangle free subgraphs
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Ramsey's theorem - a new lower bound
• The size Ramsey number
• Asymptotic lower bounds for Ramsey functions
• Constructive lower bounds on classical multicolor Ramsey numbers
• The minimum degree of Ramsey-minimal graphs
• On Ramsey Minimal Graphs
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
• On size Ramsey number of paths, trees, and circuits. I
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the independence number of sparse graphs
• Dynamic concentration of the triangle-free process
• On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs
• The Construction of Certain Graphs
• Some remarks on the theory of graphs
• The size-Ramsey number of trees
• On size Ramsey numbers of graphs with bounded degree