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–Ko–Rado-type theorems on hypergraphs | Statement: [Erdős–Ko–Rado theorem, hasGeneralization, Erdős–Ko–Rado-type theorems on hypergraphs]

Target entity: Erdős–Ko–Rado-type theorems on hypergraphs
Context triple: [Erdős–Ko–Rado theorem, hasGeneralization, Erdős–Ko–Rado-type theorems on hypergraphs]

• A. Erdős–Ko–Rado theorem chosen
  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.
• B. Ahlswede–Khachatrian complete intersection theorem
  The Ahlswede–Khachatrian complete intersection theorem is a fundamental result in extremal set theory that fully characterizes the largest intersecting families of k-element subsets for all parameter ranges, extending and sharpening the Erdős–Ko–Rado theorem.
• 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 on Graphs: His Legacy
  Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
• E. Tverberg’s theorem
  Tverberg’s theorem is a fundamental result in combinatorial geometry that guarantees any sufficiently large set of points in Euclidean space can be partitioned into subsets whose convex hulls all intersect.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.