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. J Graph Theory 55: 1–13, 2007

[1]  J. Singer.  A theorem in finite projective geometry and some applications to number theory , 1938 .

[2]  András Frank,et al.  On the orientation of graphs , 1980, J. Comb. Theory, Ser. B.

[3]  Alex Scott,et al.  Better bounds for Max Cut , 2002 .

[4]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[5]  N. Alon.  Monochromatic directed walks in arc-colored directed graphs , 1987 .

[6]  András Gyárfás,et al.  Hall ratio of the Mycielski graphs , 2006, Discret. Math..

[7]  Zsolt Tuza,et al.  Maximum cuts and largest bipartite subgraphs , 1993, Combinatorial Optimization.

[8]  S. C. Locke.  Maximum k-colorable subgraphs , 1982, J. Graph Theory.

[9]  C. S. Edwards.  Some Extremal Properties of Bipartite Subgraphs , 1973, Canadian Journal of Mathematics.

[10]  Noga Alon,et al.  Maximum cuts and judicious partitions in graphs without short cycles , 2003, J. Comb. Theory B.

[11]  Noga Alon,et al.  Bipartite subgraphs of integer weighted graphs , 1998, Discret. Math..

[12]  Svatopluk Poljak,et al.  A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound , 1986, Discret. Math..

[13]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[14]  Monique Laurent,et al.  Max-cut problem , 1997 .

[15]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .

[16]  Béla Bollobás,et al.  Judicious partitions of bounded-degree graphs , 2004 .

[17]  N. Alon,et al.  MaxCut in ${\bm H)$-Free Graphs , 2005, Combinatorics, Probability and Computing.

[18]  Zs. Tuza,et al.  Triangle-free partial graphs and edge covering theorems , 1982, Discret. Math..