{"id":"palomar/PALOMAR-2026-11-14-000022","url":"https://github.com/jtraverso/keevash-triangle-decompositions/tree/d2dac04ee5299b1a60bfa20b7eb60afda4527483","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000022-v1.json","repo":"https://github.com/jtraverso/keevash-triangle-decompositions","tags":["math.CO","msc:05C70","msc:05B07","msc:05C80"],"score":0,"title":"Keevash, Counting designs, Theorem 2.1: triangle decompositions of (c,16)-typical graphs","trust":"high","domain":"math.CO","source":"palomar","authors":["Juan Pablo Traverso Gianini"],"reviews":0,"subject":"math.CO","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"Counting designs","identifier":"arXiv:1504.02909","relationship":"formalizes"}]}