Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
complete uniform hypergraphs
|
| gptkbp:concerns |
hypergraph theory
set systems |
| gptkbp:field |
combinatorics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Baranyai's theorem
|
| gptkbp:namedAfter |
gptkb:Zsolt_Baranyai
|
| gptkbp:relatedTo |
design theory
factorization of hypergraphs |
| gptkbp:sentence |
If n is divisible by k, then the complete hypergraph K_n^k can be partitioned into 1-factorizations.
|
| gptkbp:yearProved |
1975
|
| gptkbp:bfsParent |
gptkb:Laszlo_Baranyai
|
| gptkbp:bfsLayer |
7
|