Unverified50% confidenceFactExact time

Cycle Double Cover猜想等价于任意无桥图都可嵌入某个闭合曲面，使得每条边恰好出现在两个面的边界上

1

Sources

50%

Confidence

Long-term

Relevance

7/16/2026

First Seen

Sources

Did GPT-5.6 Crack a 50-Year-Old Graph Theory Conjecture? A Full Evidence Chain Breakdown

Related Claims

Unverified该猜想等价于每个无割边图都可以被嵌入某个闭合曲面74% similar Unverified两条龙曲线可背靠背拼合成双龙形状，四条则可填满一个矩形区域，龙曲线能够密铺平面65% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/533528

API

curl https://kongchang.com/api/v1/knowledge/claims/533528

MCP

get_claim(id=533528)