A Combinatorial Problem in Geometry

2009/01/01 by P. Erdös, G. Szckeres · 7 citations
Mathematics · #Mathematics and Applications #History and Theory of Mathematics #Advanced Mathematical Theories #Geometry #Discrete geometry #Computer science #Mathematics

paper · doi:10.1007/978-0-8176-4842-8_3

openalex publication_date 2009/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15

Abstract

Our present problem has been suggested by Miss Esther Klein in connection with the following proposition. From 5 points of the plane of which no three lie on the same straight line it is always possible to select 4 points determining a convex quadrilateral.

Cited by

• Stack-Number is Not Bounded by Queue-Number
• Twin-width VIIIa: Delineation
• Ramsey's theorem—A new lower bound
• Induced Ramsey-type theorems
• On two problems in graph Ramsey theory
• A new upper bound for diagonal Ramsey numbers
• Density theorems for bipartite graphs and related Ramsey-type results
• Expected length of the longest common subsequence for large alphabets
• Approximations of Weighted Independent Set and Hereditary Subset Problems
• Approximating maximum independent sets by excluding subgraphs
• Unavoidable cycle lengths in graphs
• Graph Minors. XVI. Excluding a non-planar graph
• Small permutation classes
• Maximum induced trees in graphs
• Art Gallery and Illumination Problems
• Finding Convex Sets Among Points in the Plane
• Note on the Erdos - Szekeres Theorem
• Computer solution to the 17-point Erdős-Szekeres problem
• Forced Convex n -Gons in the Plane
• Ramsey numbers for sparse graphs
• Minimal scrambling sets of simple orders
• Erdős–Szekeres theorem [wikipedia]
• Ramsey's theorem [wikipedia]