Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Erdős–Szekeres problem on convex polygons | Statement: [Esther Szekeres, associatedWith, Erdős–Szekeres problem on convex polygons]

Target entity: Erdős–Szekeres problem on convex polygons
Context triple: [Esther Szekeres, associatedWith, Erdős–Szekeres problem on convex polygons]

• A. Erdős–Szekeres theorem chosen
  The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
• B. Sylvester–Gallai theorem
  The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.
• C. Erdős distinct distances problem
  The Erdős distinct distances problem is a famous question in combinatorial geometry that asks for the minimum number of distinct distances determined by a given number of points in the plane.
• D. Helly’s theorem
  Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
• E. Carathéodory’s theorem in convex geometry
  Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.