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–Stone–Simonovits theorem | Statement: [Erdős–Stone theorem, hasVariant, Erdős–Stone–Simonovits theorem]

Target entity: Erdős–Stone–Simonovits theorem
Context triple: [Erdős–Stone theorem, hasVariant, Erdős–Stone–Simonovits theorem]

• A. Erdős–Stone theorem chosen
  The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
• B. Turán's theorem
  Turán's theorem is a fundamental result in extremal graph theory that determines the maximum number of edges a graph can have without containing a complete subgraph of a given size.
• C. Pósa’s theorem in graph theory
  Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
• D. 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.
• E. Bondy–Chvátal theorem
  The Bondy–Chvátal theorem is a fundamental result in graph theory that characterizes when a graph can be extended to a Hamiltonian graph via closure operations, providing a powerful tool for proving the existence of Hamiltonian cycles.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.