Maximum directed cuts in acyclic digraphs

It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs.

• Type: Journal
• Year: 2007
• Where: JGT
• Authors: Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
• Keywords: Directed Cut, JGT 2007, Larger Constant