Preprint
Jul 2026
Erd\H{o}s-Ko-Rado-type problem for hypergraph matchings
Given integers $1\leq t\leq 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 $t$ common edges. This concept unifies several well-studied classes of intersecting families, including classical intersecting families, inte...
Binwei Zhao, Tao Feng, Xiao-Miao Wang et al.
· 0 citations