Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs

DOI10.1017/S0963548315000395zbMath1372.05147OpenAlexW2526061477MaRDI QIDQ5366925

Yury Person, Dennis Clemens

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548315000395

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Recent developments in graph Ramsey theory
• The minimum degree of Ramsey-minimal graphs
• On Ramsey Minimal Graphs
• On chromatic number of graphs and set-systems

This page was built for publication: Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs