scientific article; zbMATH DE number 5019923
From MaRDI portal
Publication:5290279
zbMath1090.52014MaRDI QIDQ5290279
Publication date: 28 April 2006
Full work available at URL: http://www.msri.org/communications/books/Book52/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Erdős-Szekeres convex polygon problem ⋮ Almost empty monochromatic triangles in planar point sets ⋮ An improved upper bound for the Erdős-Szekeres conjecture ⋮ Erdős-Szekeres without induction ⋮ Abstract order type extension and new results on the rectilinear crossing number ⋮ Separating families of convex sets ⋮ On the order dimension of convex geometries ⋮ On the Erdős–Szekeres problem in combinatorial geometry ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ Two upper bounds for the Erdős-Szekeres number with conditions ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Interior points in the Erdős-Szekeres theorems ⋮ The Erdős-Szekeres theorem and congruences ⋮ Erdős-Szekeres theorem for point sets with forbidden subconfigurations ⋮ Unnamed Item ⋮ Almost empty hexagons ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ On \(k\)-convex point sets ⋮ Empty monochromatic simplices ⋮ Empty convex hexagons in planar point sets ⋮ Obstacle numbers of graphs ⋮ Coloring copoints of a planar point set ⋮ Regular systems of paths and families of convex sets in convex position ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Erdős-Szekeres theorem for lines ⋮ Faster counting empty convex polygons in a planar point set ⋮ On Erdős-Szekeres-type problems ⋮ Geometric biplane graphs. II: Graph augmentation
This page was built for publication:
