scientific article; zbMATH DE number 3168302

Cited in

(71)

More on an Erdős-Szekeres-type problem for interior points
Topologically sweeping an arrangement
Nine convex sets determine a pentagon with convex sets as vertices
On the combinatorial classification of nondegenerate configurations in the plane
The complexity of point configurations
Convex independent sets and 7-holes in restricted planar point sets
On some problems of elementary and combinatorial geometry
Existence of submatrices with all possible columns
Highly saturated packings and reduced coverings
Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
Point configurations in \(d\)-space without large subsets in convex position
Point sets with small integer coordinates and no large convex polygons
Two upper bounds for the Erdős-Szekeres number with conditions
A note on the value in the disjoint convex partition problem
On the existence of a point subset with 3 or 6 interior points
Faster counting empty convex polygons in a planar point set
On weighted sums of numbers of convex polygons in point sets
Two extensions of the Erdős-Szekeres problem
On \(k\)-convex point sets
Covering paths for planar point sets
On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
Twenty years of progress of \(\mathrm{JCDCG}^3\)
A note on the upper bound for disjoint convex partitions
Erdős--Szekeres theorem with forbidden order types
On some monotone path problems in line arrangements
Almost empty hexagons
Empty convex hexagons in planar point sets
Coloring copoints of a planar point set
The maximum size of a convex polygon in a restricted set of points in the plane
Empty squares in arbitrary orientation among points
Regular systems of paths and families of convex sets in convex position
The Erdős-Szekeres Problem
On Erdős-Szekeres-type problems
Almost empty monochromatic triangles in planar point sets
An improved upper bound for the Erdős-Szekeres conjecture
Erdős-Szekeres without induction
On the Erdős–Szekeres problem in combinatorial geometry
Separating families of convex sets
On the order dimension of convex geometries
scientific article; zbMATH DE number 3626171 (Why is no real title available?)
Erdős-Szekeres theorem for point sets with forbidden subconfigurations
Convex polygons in Cartesian products
Convex drawings of the complete graph: topology meets geometry
Specified holes with pairwise disjoint interiors in planar point sets
On the Erdős-Szekeres convex polygon problem
The Erdős-Szekeres problem and an induced Ramsey question
A SAT attack on the Erdős-Szekeres conjecture
On Erdős-Szekeres-type problems for \(k\)-convex point sets
A SAT attack on the Erdős-Szekeres conjecture
Some extremal problems in geometry
Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
Erdős-Szekeres theorem for k-flats
Universal sequences of lines in \(\mathbb{R}^d\)
On some extremal results for order types
The Dirac-Goodman-Pollack conjecture
The never-ending happiness of Paul Erdős's mathematics
Formal verification of the empty hexagon number
Weights of convex quadrilaterals and empty triangles in weighted point sets
Partitions of complete twisted graphs into plane spanning trees
Big line or big convex polygon
Partitioning complete geometric graphs on dense point sets into plane subgraphs
Saturation results around the Erdős-Szekeres problem
Saturation results around the Erdős-Szekeres problem
Partitioning complete geometric graphs on dense point sets into plane subgraphs
Almost empty monochromatic polygons in planar point sets
The Erdős-Szekeres conjecture revisited
The Erdős-Szekeres conjecture revisited
A Ramsey-type result for geometric -hypergraphs
Erdős-Szekeres theorem for lines
On \(k\)-gons and \(k\)-holes in point sets
On the minimum number of mutually disjoint holes in planar point sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286826)