Abstract
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity par......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
