A Hall-type condition for path covers in bipartite graphs

Mikhail Lavrov, Jennifer Vandenbussche

Let $G$ be a bipartite graph with bipartition $(X,Y)$. Inspired by a hypergraph problem, we seek an upper bound on the number of disjoint paths needed to cover all the vertices of…