scientific article
From MaRDI portal
Publication:3286826
zbMath0103.15502MaRDI QIDQ3286826
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Erdős-Szekeres convex polygon problem, Erdős--Szekeres theorem with forbidden order types, Almost empty monochromatic triangles in planar point sets, An improved upper bound for the Erdős-Szekeres conjecture, Erdős-Szekeres without induction, The maximum size of a convex polygon in a restricted set of points in the plane, On some monotone path problems in line arrangements, On weighted sums of numbers of convex polygons in point sets, Separating families of convex sets, Topologically sweeping an arrangement, Nine convex sets determine a pentagon with convex sets as vertices, Convex drawings of the complete graph: topology meets geometry, Highly saturated packings and reduced coverings, On the order dimension of convex geometries, Erdős-Szekeres theorem for \(k\)-flats, Universal sequences of lines in \(\mathbb{R}^d\), On the Erdős–Szekeres problem in combinatorial geometry, On the combinatorial classification of nondegenerate configurations in the plane, On \(k\)-gons and \(k\)-holes in point sets, Two upper bounds for the Erdős-Szekeres number with conditions, On the minimum number of mutually disjoint holes in planar point sets, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Point sets with small integer coordinates and no large convex polygons, Empty squares in arbitrary orientation among points, THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Point configurations in \(d\)-space without large subsets in convex position, A SAT attack on the Erdős-Szekeres conjecture, Two extensions of the Erdős-Szekeres problem, The complexity of point configurations, Almost empty hexagons, Convex independent sets and 7-holes in restricted planar point sets, Specified holes with pairwise disjoint interiors in planar point sets, A SAT attack on the Erdős-Szekeres conjecture, A note on the value in the disjoint convex partition problem, On \(k\)-convex point sets, Covering paths for planar point sets, Ramsey-remainder for convex sets and the Erdős-Szekeres theorem, Empty convex hexagons in planar point sets, On some problems of elementary and combinatorial geometry, On the existence of a point subset with 3 or 6 interior points, Coloring copoints of a planar point set, Regular systems of paths and families of convex sets in convex position, Existence of submatrices with all possible columns, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets, A Ramsey-type result for geometric \(\ell\)-hypergraphs, On Erdős-Szekeres-type problems for \(k\)-convex point sets, Erdős-Szekeres theorem for lines, Convex polygons in Cartesian products, Twenty years of progress of \(\mathrm{JCDCG}^3\), Faster counting empty convex polygons in a planar point set, The Erdős-Szekeres Problem, More on an Erdős-Szekeres-type problem for interior points, On Erdős-Szekeres-type problems, A note on the upper bound for disjoint convex partitions
