On Ramsey numbers of uniform hypergraphs with given maximum degree

DOI10.1016/j.jcta.2005.12.007zbMath1108.05064OpenAlexW2097642692MaRDI QIDQ855851

Vojtěch Rödl, Alexandr V. Kostochka

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.12.007

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (12)

Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Tower Gaps in Multicolour Ramsey Numbers ⋮ Linear Ramsey Numbers for Bounded-Degree Hypergrahps ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Hypergraph Ramsey numbers ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ On the Ramsey number of sparse 3-graphs ⋮ Ramsey numbers of sparse hypergraphs ⋮ On Ramsey numbers of hedgehogs ⋮ Finding the shortest path for a Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs with small Ramsey numbers. II.
• The Ramsey number of a graph with bounded maximum degree
• A note on the independence number of triangle-free graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Asymptotic lower bounds for Ramsey functions
• Graphs with linearly bounded Ramsey numbers
• On graphs with small Ramsey numbers*
• Subdivided graphs have linear ramsey numbers
• On Ramsey Numbers of Sparse Graphs

This page was built for publication: On Ramsey numbers of uniform hypergraphs with given maximum degree