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: Robbins theorem | Statement: [Herbert Robbins, knownFor, Robbins theorem]

Target entity: Robbins theorem
Context triple: [Herbert Robbins, knownFor, Robbins theorem]

• A. 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.
• B. 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.
• C. 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.
• D. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• E. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• 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: Robbins theorem
Triple: [Herbert Robbins, knownFor, Robbins theorem]

Robbins theorem is a result in graph theory that characterizes when a connected graph can be oriented to become strongly connected, providing a key condition for the existence of strongly connected orientations.

Target entity: Robbins theorem
Target entity description: Robbins theorem is a result in graph theory that characterizes when a connected graph can be oriented to become strongly connected, providing a key condition for the existence of strongly connected orientations.

• A. 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.
• B. 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.
• C. 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.
• D. Graham–Rothschild theorem
  The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
• E. Graham–Pollak theorem
  The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
• F. None of above. chosen