{"id":"palomar/PALOMAR-2026-11-06-000003","url":"https://github.com/jtraverso/baranyai-theorem/tree/0ff6d6f4005b0b68114e0b99e6d342742918b629","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-06-000003-v1.json","repo":"https://github.com/jtraverso/baranyai-theorem","tags":["math.CO","msc:05C65","msc:05C70","msc:90C35"],"score":0,"title":"Baranyai's theorem","trust":"high","domain":"math.CO","source":"palomar","authors":["Juan Pablo Traverso Gianini"],"reviews":0,"subject":"math.CO","summary":"A Lean 4 / Mathlib formalization of Baranyai's theorem: if k divides n, the k-subsets of an n-set can be partitioned into (n−1 choose k−1) parallel classes, each a partition of the set into n/k blocks of size k (a 1-factorization of the complete k-uniform hypergraph); and of Baranyai's rounding lemma: every real matrix can be rounded entrywise to floors or ceilings so that all row sums, column sums and the total are also rounded. The proof includes the integral max-flow theorem for integer capacities. Mathlib has neither result.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-06","reactions":{},"formalized":true,"formalizes":[{"title":"On the factorization of the complete uniform hypergraph","identifier":"","relationship":"formalizes"}]}