GPT-5.6 Pro falsifies a 30-year graph theory conjecture as Sol+Codex solves 6 Erdős problems
新智元 · wechat · 2026-07-24
GPT-5.6 Pro and Sol are used to break a 30-year graph theory conjecture and solve six open problems
A new Chinese article claims GPT-5.6 Pro produced a counterexample to the Dinitz-Garg-Goemans conjecture in graph theory, turning a 30-year-open cost-version problem into a false statement. The counterexample uses three terminals with costs structured so that any integral solution must pay at least 60, while a fractional solution reaches 58.
The same piece also says Shouqiao Wang used GPT-5.6 Sol + Codex to solve 6 of 13 attempted open Erdős problems in 5 days, including one that ran for 32 hours. His workflow emphasized:
- selecting problems mathematicians were already actively discussing,
- precisely redefining what counts as a solution,
- and using adversarial agents to attack each candidate proof before finalizing it.
The article frames these cases as evidence that AI is becoming a serious research partner in mathematics, and speculates about the implications for future human-only prizes like the Fields Medal.
Related event: GPT-5.6 Pro Reportedly Refutes Decades-Old Graph Theory Conjecture(5 posts)→
More from AGI Musings
- Paper asks whether Claude can consent to its own constitution — dhadfieldmenell · 2026-07-24
- A repost argues frontier AI should prioritize defense and disease research — moonsandhues · 2026-07-24
- Musk’s honest AI view is that nobody knows what superintelligence brings — danfaggella · 2026-07-24
- Gary Marcus says AGI may come this century, but pure LLMs still won’t get there — GaryMarcus · 2026-07-24
- Frontier AI winners are the teams that can turn hypotheses into evidence fastest — JasonMa2020 · 2026-07-24
- A DARPA-style challenge for containing frontier agents could create open safety data — joshua_saxe · 2026-07-24