How many matchings cover the nodes of a graph?

Dehia Ait Ferhat, Zoltán Király, András Sebő +1

Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possi…