Entity · other

Cycle Double Cover Conjecture

otheractiveprovisionalcycle-double-cover-conjecture-9e4c8b49·1 events·first seen 28h ago

Aliases: Cycle Double Cover Conjecture

Co-occurring entities

More like this (12)

OEIS Conjectures Deep Double Descent Fenchel duality Shannon-Hartley Theorem Doppel Polyak–Łojasiewicz Condition Poincaré separation theorem extended simulation lemma uniform exterior separability Formalizing the Binding Problem Discrete Exterior Calculus Parallel Box Decoding

Recent events (1)

9Hacker News·28h ago·source ↗

GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture

OpenAI has published a PDF document claiming that GPT-5.6 Sol Ultra has produced a proof of the Cycle Double Cover Conjecture, a major open problem in graph theory unsolved since the 1970s. The conjecture states that every bridgeless graph has a cycle double cover, and its resolution would be a landmark result in combinatorics. If verified, this would represent a significant frontier capability milestone for AI-assisted mathematical reasoning. The HN post attracted 224 points and 203 comments, indicating substantial community attention.

Frontier Model Releases OpenAI GPT-5.6 Sol Ultra Cycle Double Cover Conjecture