1 paper
Jia-Bao Yang, Leilei Zhang
Given a graph F, a hypergraph is called a Berge-F if it can be obtained by expanding each edge of F into a hyperedge containing it. Let Mk denote the matching of size $k…