{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-06","reactions":{},"formalized":true,"formalizes":[{"title":"Counting designs","identifier":"doi:10.4171/JEMS/779","relationship":"formalizes"}]}