Abstract
Let phi Hr(n) be the smallest integer such that, for all r-graphs G on n vertices, the edge set E(G) can be partitioned into at most phi Hr(n) parts, ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
