Erdős Problem 593: classification of obligatory triple systems
Source: github.com/SamPetkov/Erdos593-formalization/tree/ea81bf2615…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-16-000018
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000018/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000018/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'