Id: palomar/PALOMAR-2026-11-06-000011 Url: https://github.com/jtraverso/keevash-typical-triangle-decompositions/tree/6eb072d132ff300374286b314a4ae7ef6512a8b4 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000011-v1.json Repo: https://github.com/jtraverso/keevash-typical-triangle-decompositions Tags: math.CO, msc:05C70, msc:05B07 Score: 0 Title: Triangle decompositions of typical graphs of fixed density (Keevash, Counting designs, Theorem 2.1, weaker form) Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-06 Formalized: true Formalizes: title=Counting designs identifier=doi:10.4171/JEMS/779 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-06-000011 A Lean 4 / Mathlib formalization of a weaker, fixed-density form of Theorem 2.1 of P. Keevash, Counting designs (J. Eur. Math. Soc. 20, 2018). density G is |E(G)| / C(n, 2); IsTypical G c h says that every nonempty set S of at most h vertices has (1 ± |S| c) d(G)^|S| n common neighbours; Tridivisible G says that every degree is even and 3 divides |E(G)|; IsTriangleDecomposition G D says that D is a family of triangles of G and every edge lies in exactly one of them. typical_triangle_decomposition: there is h such that for every d0 > 0 there are c0 > 0 and n0 such that every (c0, h)-typical…