Id: palomar/PALOMAR-2026-11-19-000022 Url: https://github.com/jtraverso/keevash-designs-ii-kahn/tree/e27207ee346c481e0cbfc9c236b941c64a8647e8 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000022-v1.json Repo: https://github.com/jtraverso/keevash-designs-ii-kahn Tags: math.CO, math.PR, msc:05C65, msc:05C70 Score: 0 Title: Keevash, The existence of designs II: Lemma kahn+ with equal weights, and the nibble matching for [0,1]-valued tests 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-19 Formalized: true Formalizes: title=The existence of designs II identifier=arXiv:1802.05900 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000022 A Lean 4 / Mathlib formalization of the equal-weight case of Lemma kahn+ of P. Keevash, "The existence of designs II" (arXiv:1802.05900), deduced from the theorem of Ehard, Glock and Joos on pseudorandom hypergraph matchings, and of the form in which it is applied in the proof of Lemma 3.9 (nibble). (1) DesignsII.kahn_plus_equal_weights: for 0 < δ < 1 and k ≥ 2 there is Δ₀ such that, for every real Δ ≥ Δ₀, every finite hypergraph H whose edges have at most k vertices, whose degrees are at most Δ and whose codegrees of distinct vertices are at most Δ^(1−δ), with |H| ≤ exp(Δ^((δ/(50k²))²)),…