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: Hamiltonian cycle concept | Statement: [William Rowan Hamilton, knownFor, Hamiltonian cycle concept]

Target entity: Hamiltonian cycle concept
Context triple: [William Rowan Hamilton, knownFor, Hamiltonian cycle concept]

• A. Seven Bridges of Königsberg problem
  The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
• B. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• C. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• D. Conway circle theorem
  The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
• E. de Bruijn sequence
  A de Bruijn sequence is a cyclic sequence over a given alphabet in which every possible subsequence of a fixed length appears exactly once.
• 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: Hamiltonian cycle concept
Triple: [William Rowan Hamilton, knownFor, Hamiltonian cycle concept]

The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.

Target entity: Hamiltonian cycle concept
Target entity description: The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.

• A. Seven Bridges of Königsberg problem
  The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
• B. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• C. Conway's thrackle conjecture
  Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
• D. Conway circle theorem
  The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
• E. de Bruijn sequence
  A de Bruijn sequence is a cyclic sequence over a given alphabet in which every possible subsequence of a fixed length appears exactly once.
• F. None of above. chosen