Spanning trees in the Assignment Problem: two theorems and two conjectures

Sergio Caracciolo, Gabriele Sicuro, Andrea Sportiello

The \emph{Minimum Matching Problem} consists of finding an independent edge set of minimum weight $M_{\star }(G)$ in a given edge-weighted graph $G$. When $G$ is bipartite, this red…