Maximum directed cuts in acyclic digraphs
Noga Alon, Béla Bollobás, András Gyárfás, Jenő Lehel, Alex Scott · Journal of Graph Theory · 2006
Abstract 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 the largest directed cut in acyclic digraphs, and prove a number of related results concerning cuts in digraphs and acyclic digraphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 55: 1–13, 2007