A sufficient condition for a hypergraph to have a Berge-$k$-factor

Yuping Gao, Songling Shan, Gexin Yu

For any graph (hypergraph) $G$ with vertex set $V$ and edge set $E$, we define its incidence bipartite graph $\mathcal{I}(G)$ as the bipartite graph with bipartition $(E,V)$, wher…