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: Turán's theorem | Statement: [Pál Turán, hasTheoremNamedAfter, Turán's theorem]

Target entity: Turán's theorem
Context triple: [Pál Turán, hasTheoremNamedAfter, Turán's theorem]

• A. Turán's theorem chosen
  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.
• B. Erdős–Stone theorem
  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.
• 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–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• E. Turán's method
  Turán's method is a powerful technique in analytic and probabilistic number theory that uses inequalities for power sums of sequences to derive bounds for arithmetic functions and related quantities.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.