Abstract
This paper studies the quantity p(n, r), that is the minimal number of edges of an n-uniform hypergraph without panchromatic coloring (it means that e......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
