On maximum $k$-edge-colorable subgraphs of bipartite graphs

Liana Karapetyan, Vahan Mkrtchyan

If $k\ge 0$, then a $k$-edge-coloring of a graph $G$ is an assignment of colors to edges of $G$ from the set of $k$ colors, so that adjacent edges receive different colors. A $k$-…