Trees and $n$-Good Hypergraphs

zbMath1405.05125arXiv1710.05731MaRDI QIDQ4622621

Andrew Penland, Mark R. Budden

Publication date: 13 February 2019

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

zbMATH Keywords

\(r\)-uniform hypergraphs\(r\)-uniform hypergraph Ramsey numbers

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (4)

Sierpiński products of r-uniform hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constructive Methods in Gallai-Ramsey Theory for Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on embedding hypertrees
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Coloring H-free hypergraphs
• Generalizations of a Ramsey-theoretic result of chvátal
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• Ramsey Theorems for Multiple Copies of Graphs

This page was built for publication: Trees and $n$-Good Hypergraphs