Mahmoodian–Mirzakhani conjecture
Mahmoodian–Mirzakhani conjecture
For positive integers , the complete tripartite graph admits a decomposition into -cycles if and only if , , and ; that is, there is a collection of -cycles such that is the disjoint union of the edge sets of the cycles in .
Progress summary
A new paper proves the conjecture on its equality boundary and certifies 117 more cases, but the full conjecture remains open.
Mahmoodian and Mirzakhani posed the conjecture in 1995: for , the necessary parity, divisibility, and size conditions for decomposing into -cycles should also be sufficient.
Known results
- Equal part sizes: sufficiency was proved apart from the exceptional family with (Mahmoodian–Mirzakhani, 1995).
- All part sizes even, and several cases with equal or suitably divisible parts, were settled (Cavenagh–Billington, 2011).
- Further infinite families include all parts divisible by under additional size restrictions (2019).
- The odd, distinct-size case has remained the principal unresolved regime.
August 2026 boundary result
Bryant and Mačajová report a constructive proof of the equality-boundary case and computational certificates for 117 additional previously unresolved decompositions. Their preprint explicitly leaves the strict-interior cases open, so this is substantial partial progress rather than a solution of the conjecture.
Current status (as of August 2026): The equality-boundary case and 117 additional cases are settled in the new preprint, while the full conjecture for strict-interior triples remains open.
Sources & referencesView supporting material
Primary source
Additional references
- Completing the Boundary Case of the Mahmoodian-Mirzakhani Conjecture and 117 New Computational 5-Cycle Decompositions of Complete Tripartite Graphs — arXiv — Darryn Bryant, Barbara Mačajová
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.