A Ramsey-type result for geometric \(\ell\)-hypergraphs

DOI10.1016/j.ejc.2014.04.001zbMath1297.05159arXiv1305.5227OpenAlexW2511892149MaRDI QIDQ740277

Andrew Suk, Dhruv Mubayi

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Szekeres theorem3-uniform hypergraph Ramsey problem

Mathematics Subject Classification ID

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

Related Items (1)

Semi-algebraic Ramsey numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on Ramsey numbers
• Ramsey-type results for geometric graphs. II
• Crossing families
• Ramsey-type results for geometric graphs. I
• Extremal problems for geometric hypergraphs
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• Point configurations in \(d\)-space without large subsets in convex position
• A decomposition theorem for partially ordered sets
• A Note on Geometric 3-Hypergraphs
• The Rectilinear Crossing Number of K n : Closing in (or Are We?)
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Hypergraph Ramsey numbers
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Ramsey-remainder for convex sets and the Erdős-Szekeres theorem

This page was built for publication: A Ramsey-type result for geometric \(\ell\)-hypergraphs