Every graph of minimum degree at least 5 contains a cycle whose length is divisible by 5.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
Every graph of minimum degree at least 5 contains a cycle whose length is divisible by 5. Open residue: Only k=5 remains.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 4/5
The original all-k conjecture is now settled for every k except 5, leaving one crisp graph-search target.
- finite witness
- 4/5
- oracle cost
- 3/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Enumerate or SAT-generate minimum-degree-5 graphs and test cycle lengths; a counterexample is an explicit graph. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.