graph theory

Artificial intelligence may have produced one of its most interesting mathematical moments yet—but the most important word is still may. A newly circulated counterexample to the long-standing Dinitz–Garg–Goemans conjecture in graph theory is being credited to conversations involving OpenAI’s...

OpenAI says its GPT-5.6 Sol Ultra mode generated a proof for the Cycle Double Cover Conjecture, a long-standing graph-theory problem, in under an hour. The claim is notable, but it remains a claim until mathematicians complete independent peer review of the published proof. The model launched...