scientific article; zbMATH DE number 800308

MaRDI QIDQ4849067zbMATH OpenFDO

Authors J. G. Kalbfleisch, R. G. Stanton

Publication date 28 April 1996

zbMATH Keywords

convex \(n\)-gonsproblem of Erdös-Szekeres

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• Forced convex \(n\)-gons in the plane
• A Remark on the Erdos-Szekeres Theorem
• EMPTY CONVEX 5-GONS IN PLANAR POINT SETS
• On the Erdös-Szekeres problem
• Empty convex hexagons in planar point sets
• Two upper bounds for the Erdős-Szekeres number with conditions
• A new proof of the Erdős-Szekeres convex k-gon result
• Note on the Erdős-Szekeres theorem
• Computer solution of the almost empty hexagon problem
• A sufficient condition for the existence of large empty convex polygons

Cited in

(11)

• The maximum number of unit distances in a convex \(n\)-gon
• The Erdős-Szekeres Problem
• On the decay of the smallest singular value of submatrices of rectangular matrices
• Two upper bounds for the Erdős-Szekeres number with conditions
• Point sets with small integer coordinates and no large convex polygons
• No repeated slopes, triangles and polygons
• The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles
• The never-ending happiness of Paul Erdős's mathematics
• The Erdos-Szekeres problem on points in convex position – a survey

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 Q4849067)