Baranyai's theorem

Baranyai's theorem A partition of a complete graph on 8 vertices into 7 colors (perfect matchings), the case r = 2 of Baranyai's theorem In combinatorial mathematics, Baranyai's theorem (proved by and named after Zsolt Baranyai) deals with the decompositions of complete hypergraphs.

Contents 1 Statement of the theorem 2 The case '"`UNIQ--postMath-00000005-QINU`"' 3 History 4 References Statement of the theorem The statement of the result is that if {displaystyle 2leq r

Si quieres conocer otros artículos parecidos a Baranyai's theorem puedes visitar la categoría Hypergraphs.