Erdős-Ko-Rado-type problem for hypergraph matchings

Binwei Zhao, Tao Feng, Xiaomiao Wang +1

Given integers $1\le t\le k$, a family of $k$-matchings in a complete $r$-partite $r$-uniform hypergraph is said to be $t$-intersecting if any two of its members share at least $…