Unverified50% confidenceFactExact time
Cycle Double Cover（圈双覆盖）猜想由Seymour和Szekeres分别于1979年独立提出，断言对于任意无桥连通图存在一组圈使每条边恰好被覆盖两次
1
Sources
50%
Confidence
Long-term
Relevance
7/23/2026
First Seen
Sources
Related Claims
VerifiedThe Cycle Double Cover Conjecture was independently proposed by Seymour and Szekeres in the 1970s and is one of the most famous unsolved problems in graph theory.76% similarUnverifiedJaeger（1985）、Goddyn等人在特殊图类上取得了Cycle Double Cover猜想的部分进展，但一般情形至今悬而未决56% similarUnverified循环双重覆盖猜想至今依然是公认的开放猜想，没有任何被数学界认可的完整证明53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/602539API
curl https://kongchang.com/api/v1/knowledge/claims/602539MCP
get_claim(id=602539)