Keevash, Counting designs, Theorem 2.1: triangle decompositions of (c,16)-typical graphs
Source: github.com/jtraverso/keevash-triangle-decompositions/tree/d…
A Lean 4 / Mathlib formalization of Theorem 2.1 of P. Keevash, "Counting designs" (arXiv:1504.02909), for (c,16)-typical graphs: there are c₀ > 0 and n₀ such that every graph G on n ≥ n₀ vertices with all degrees even and 3 | e(G) that is (c,16)-typical, with density d(G) > n^(-10^-7) and c ≤ c₀·d(G)^(10^6), has a triangle decomposition (KeevashTri.theorem_2_1). (c,h)-typical means |⋂_{x∈S} G(x)| = (1 ± |S|c)·d(G)^|S|·n for every vertex set S with |S| ≤ h; the paper's theorem assumes only c-typicality (h = 2, with the paper's tolerance), so the hypothesis here is stronger, and the paper's…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-14-000022
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000022/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-14-000022/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'