A Ramsey-Type Result for Convex Sets

DOI10.1112/blms/26.2.132zbMath0809.05090OpenAlexW2062030188MaRDI QIDQ4314565

János Pach, Jenö Töröcsik, David G. Larman, Ji{ří} Matoušek

Publication date: 14 December 1994

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/26.2.132

zbMATH Keywords

convex compact sets

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Ramsey theory (05D10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items (33)

Disjointness graphs of segments in the space ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ Ramsey-type theorems for sets satisfying a geometric regularity condition ⋮ Symmetric chain partitions of orthocomplemented posets ⋮ A bipartite analogue of Dilworth's theorem ⋮ Turán-type results for partial orders and intersection graphs of convex sets ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Disjointness graphs of short polygonal chains ⋮ Ramsey properties of semilinear graphs ⋮ Lower bounds for piercing and coloring boxes ⋮ String graphs have the Erdős-Hajnal property ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ String graphs and incomparability graphs ⋮ Note on geometric graphs ⋮ Ramsey-type constructions for arrangements of segments ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Induced Ramsey-type theorems ⋮ Ramsey-type constructions for arrangements of segments ⋮ On Wegner's inequality for axis-parallel rectangles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem ⋮ Planar point sets determine many pairwise crossing segments ⋮ Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs ⋮ Improved Ramsey-type results for comparability graphs ⋮ On the chromatic number of disjointness graphs of curves ⋮ A bipartite analogue of Dilworth's theorem for multiple partial orders ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Hasse diagrams with large chromatic number ⋮ Helly-type problems

This page was built for publication: A Ramsey-Type Result for Convex Sets