Forced convex \(n\)-gons in the plane (Q1387846)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Forced convex \(n\)-gons in the plane
scientific article

    Statements

    Forced convex \(n\)-gons in the plane (English)
    0 references
    8 June 1998
    0 references
    Denote by \(g(n)\) the smallest number such that every set of \(g(n)\) points in the plane in general position contains the vertices of a convex \(n\)-gon. In 1935 Erdős and Szekeres proved that \[ 2^{n- 2}+ 1\leq g(n)\leq {2n-4\choose n-2}+ 1. \] The authors of the present paper lessen the right estimate by 1.
    0 references
    vertex
    0 references
    convex \(n\)-gon
    0 references
    0 references
    0 references
    0 references

    Identifiers