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: Tutte polynomial | Statement: [Bill Tutte, notableWork, Tutte polynomial]

Target entity: Tutte polynomial
Context triple: [Bill Tutte, notableWork, Tutte polynomial]

• A. Pólya enumeration theorem
  The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
• B. Alon–Tarsi conjecture
  The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
• C. Symanzik polynomials
  Symanzik polynomials are graph-based polynomials that arise in the parametric representation of Feynman integrals in quantum field theory, encoding the topology and kinematic dependence of Feynman diagrams.
• D. matrix-tree theorem
  The matrix-tree theorem is a fundamental result in algebraic graph theory that expresses the number of spanning trees of a graph as a determinant of a matrix derived from the graph’s Laplacian.
• E. Combinatorial Nullstellensatz
  Combinatorial Nullstellensatz is a powerful algebraic tool in combinatorics that uses polynomial methods over fields to derive results about combinatorial structures, such as existence and counting theorems.
• 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: Tutte polynomial
Triple: [Bill Tutte, notableWork, Tutte polynomial]

The Tutte polynomial is a fundamental graph invariant in combinatorics that encodes extensive structural information about a graph, unifying and generalizing numerous other graph invariants such as the chromatic and flow polynomials.

Target entity: Tutte polynomial
Target entity description: The Tutte polynomial is a fundamental graph invariant in combinatorics that encodes extensive structural information about a graph, unifying and generalizing numerous other graph invariants such as the chromatic and flow polynomials.

• A. Pólya enumeration theorem
  The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
• B. Alon–Tarsi conjecture
  The Alon–Tarsi conjecture is a prominent open problem in combinatorics and graph theory concerning orientations and colorings of graphs, with deep connections to Latin squares and polynomial method techniques.
• C. Symanzik polynomials
  Symanzik polynomials are graph-based polynomials that arise in the parametric representation of Feynman integrals in quantum field theory, encoding the topology and kinematic dependence of Feynman diagrams.
• D. matrix-tree theorem
  The matrix-tree theorem is a fundamental result in algebraic graph theory that expresses the number of spanning trees of a graph as a determinant of a matrix derived from the graph’s Laplacian.
• E. Combinatorial Nullstellensatz
  Combinatorial Nullstellensatz is a powerful algebraic tool in combinatorics that uses polynomial methods over fields to derive results about combinatorial structures, such as existence and counting theorems.
• F. None of above. chosen