Ringel’s conjecture
References
- Ringel’s conjecture formalization — GitHub — Walid Elkersh
Source: GitHub
Progress summary
Refreshed
Open · progress reported
Ringel posed the conjecture in : every tree with edges should decompose into copies. The asymptotic theorem is established, but the supplied evidence does not establish the remaining all- statement.
Known results
- Montgomery, Pokrovskiy, and Sudakov (; journal publication ): for sufficiently large , decomposes into copies of every tree with edges.
- Keevash and Staden (): proved a stronger quasirandom-graph packing theorem, including the complete-graph case for sufficiently large .
- Allen, Böttcher, Clemens, and Taraz (): obtained probabilistic packing results for many random trees, not the full conjecture.
Walid Elkersh’s repository machine-checks graph-theoretic and probabilistic components of the sufficiently-large- proof development. This strengthens verification of the asymptotic result but does not settle the full all- conjecture; independent review of the repository is not documented in the supplied evidence.
Current status (as of August 2026): the sufficiently-large- case is proved, while the full all- conjecture remains unsettled.
Solutions 0
No solutions have been posted yet.