Id: palomar/PALOMAR-2026-11-16-000018 Url: https://github.com/SamPetkov/Erdos593-formalization/tree/ea81bf26158876b457845f7998277fe47aa0fd02 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000018-v1.json Repo: https://github.com/SamPetkov/Erdos593-formalization Tags: math.CO, msc:05C15, msc:05C63, msc:05C65 Score: 0 Title: Erdős Problem 593: classification of obligatory triple systems Trust: high Domain: math.CO Source: palomar Authors: Samuil Petkov Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-16 Formalized: true Formalizes: title=Obligatory Triple Systems: An Alternative Proof and Lean Verification identifier=https://github.com/SamPetkov/Erdos593/tree/d834f1f42e7e0d5d2a6c23e9487563bedb1b277b relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-16-000018 A Lean 4 formalization of the finite classification of obligatory triple systems. For every finite edge-indexed simple 3-uniform hypergraph F, the compared theorem proves that F is obligatory if and only if its isolated-point reduction is linear, every hyperedge-node of its Levi graph is incident with a bridge, and every Berge cycle has even length.