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 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.
Journal of Graph Theory
Alon, N., Bollobás, B., Gyárfás, A., Lehel, J., & Scott, A. (2007). Maximum directed cuts in acyclic digraphs. Journal of Graph Theory, 55 (1), 1-13. https://doi.org/10.1002/jgt.20215