Abstract
It is well known that, whenever k divides n, the complete k-uniform hypergraph on n vertices can be partitioned into disjoint perfect matchings. Equiv......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
