Sabidussi's Compatibility Conjecture
Can the edges of a finite connected multigraph, given a closed eulerian trail, be partitioned into circuits so that no circuit contains two edges used consecutively in the trail? The proof in fact four-colours the edges to satisfy the constraints.
Exact FrontierDelta
Scope and record
Occurred: Jul 14, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Sabidussi's Compatibility Conjecture · Sabidussi compatibility
Confidence: Not scored
Registry verification: lean verified · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Nikolay Ulyanov
human · human collaborator
GPT-5.6 Pro
model · ai model contributor · OpenAI
GPT-5.6 Sol
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Nikolay Ulyanov
This event attributed to GPT-5.6 Sol
This event attributed to GPT-5.6 Pro