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: Pósa’s theorem in graph theory | Statement: [Lajos Pósa, knownFor, Pósa’s theorem in graph theory]

Target entity: Pósa’s theorem in graph theory
Context triple: [Lajos Pósa, knownFor, Pósa’s theorem in graph theory]

• A. 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.
• 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. 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.
• D. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• E. 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.
• 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: Pósa’s theorem in graph theory
Triple: [Lajos Pósa, knownFor, 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.

Target entity: Pósa’s theorem in graph theory
Target entity description: 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.

• A. 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.
• 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. 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.
• D. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• E. 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.
• F. None of above. chosen