Ramsey numbers of semi-algebraic and semi-linear hypergraphs

DOI10.1016/j.jctb.2023.07.002zbMath1521.05115arXiv2208.01010MaRDI QIDQ6051048

Zhihan Jin, István Tomon

Publication date: 19 September 2023

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

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

zbMATH Keywords

Ramsey theoryhypergraphssemi-algebraic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
• Monotonicity
• Extremal problems in discrete geometry
• Semi-algebraic Ramsey numbers
• A survey of hypergraph Ramsey problems
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• Crossing patterns of semi-algebraic sets
• Ramsey-type results for semi-algebraic relations
• On a Coloring Problem.
• Hypergraph Ramsey numbers
• A Ramsey-Type Result for Convex Sets
• Lower bounds on geometric Ramsey functions
• New lower bounds for hypergraph Ramsey numbers
• Circle graphs are quadratically χ‐bounded
• Hasse diagrams with large chromatic number
• Ramsey properties of algebraic graphs and hypergraphs
• Zarankiewicz’s problem for semilinear hypergraphs
• Partition relations for cardinal numbers
• Some remarks on the theory of graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• On a theorem of Erdős and Szekeres
• Ramsey properties of semilinear graphs