Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs

DOI10.1016/J.ENDM.2015.06.005zbMath1346.05198arXiv1502.01147OpenAlexW2963532542MaRDI QIDQ322181

Dennis Clemens, Yury Person

Publication date: 14 October 2016

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

zbMATH Keywords

minimal Ramsey hypergraphminimum degree and codegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07)

Related Items (2)

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimum degree of minimal Ramsey graphs for multiple colours
• Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
• What is Ramsey-equivalent to a clique?
• A new upper bound for diagonal Ramsey numbers
• On the use of senders in generalized Ramsey theory for graphs
• Ramsey's theorem - a new lower bound
• The size Ramsey number
• On the minimum degree of minimal Ramsey graphs
• The minimum degree of Ramsey-minimal graphs
• On Ramsey Minimal Graphs

This page was built for publication: Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs