2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/143053For integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.Discrete Mathematicstext