On Maximum Edge Cuts of Connected Digraphs
A set F of edges in a digraph D is called a directed cut if there exists a nontrivial partition of such that F consists of all directed edges from X to Y. Let denote the maximum size of a directed cut of D, and let be the set of all digraphs D such that or for any vertex v in D. We show that for any connected digraph , which provides a positive answer to a problem of Lehel, Maffray, and Preissmann. Additionally, we consider triangle-free digraphs in and answer another question of theirs.
maximum edge cuts digraph