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 conjecture | Statement: [Erdős–Szekeres theorem, relatedTo, Erdős–Szekeres conjecture]

Target entity: Erdős–Szekeres conjecture
Context triple: [Erdős–Szekeres theorem, relatedTo, Erdős–Szekeres conjecture]

• A. Erdős–Szekeres theorem
  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. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• C. Erdős–Ko–Rado theorem
  The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
• D. Erdős–Turán conjecture
  The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
• E. Szemerédi's theorem
  Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Erdős–Szekeres conjecture
Triple: [Erdős–Szekeres theorem, relatedTo, Erdős–Szekeres conjecture]

The Erdős–Szekeres conjecture is an unsolved problem in combinatorial geometry that predicts the exact minimum number of points in general position in the plane needed to guarantee a convex polygon with a given number of vertices.

Target entity: Erdős–Szekeres conjecture
Target entity description: The Erdős–Szekeres conjecture is an unsolved problem in combinatorial geometry that predicts the exact minimum number of points in general position in the plane needed to guarantee a convex polygon with a given number of vertices.

• 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. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• C. Erdős–Ko–Rado theorem
  The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
• D. Erdős–Turán conjecture
  The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
• E. Szemerédi's theorem
  Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
• F. None of above.