Abstract
The Turan hypergraph problem asks to find the maximum number of r-edges in a r-uniform hypergraph on n vertices that does not contain a clique of size......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
