Maximum directed cuts in digraphs with degree restriction

Jenö Lehel, Frédéric Maffray, Myriam Preissmann

For 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…