A bounded diameter strengthening of Kőnig's Theorem

Louis DeBiasio, António Girão, Penny Haxell +1

K\H onig's theorem says that the vertex cover number of every bipartite graph is at most its matching number (in fact they are equal since, trivially, the matching number is at mos…