1 problem

Greedy optimality conjecture for comb graphs. If $n\leq m$, then