Id: palomar/PALOMAR-2026-11-18-000003 Url: https://github.com/methuku-git-hub/generalized-oberwolfach-lean/tree/c0d30d23c6c58dc41c03c9ce126e1ce1d846519a Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-18-000003-v1.json Repo: https://github.com/methuku-git-hub/generalized-oberwolfach-lean Tags: math.CO Score: 0 Title: Generalized Oberwolfach problem: prescribed 2-factor decompositions Trust: high Domain: math.CO Source: palomar Authors: Abhishek Methuku Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-18 Formalized: true Formalizes: title=Sharp Dirac thresholds for the generalized Oberwolfach problem identifier=Final manuscript source SHA-256 5f9cef1149b88a3680cc5ccf193b7a68a18fd12105ab6c495f4f23d893e772d9 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-18-000003 A Lean formalization of a prescribed 2-factor decomposition theorem for sufficiently large even-regular graphs. The minimum-degree threshold is determined by ordinary cycle-decomposition thresholds for an arbitrary nonempty set of permitted cycle lengths; the order threshold is uniform in that set and in the prescribed list of factors.