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–Rado theorem | Statement: [Ramsey theory, hasCentralConcept, Erdős–Rado theorem]

Target entity: Erdős–Rado theorem
Context triple: [Ramsey theory, hasCentralConcept, Erdős–Rado theorem]

• A. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• B. 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.
• 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. 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.
• E. de Bruijn–Erdős theorem
  The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
• 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–Rado theorem
Triple: [Ramsey theory, hasCentralConcept, Erdős–Rado theorem]

The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.

Target entity: Erdős–Rado theorem
Target entity description: The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.

• A. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• B. 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.
• 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. 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.
• E. de Bruijn–Erdős theorem
  The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
• F. None of above. chosen