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.

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

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

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

[4]  Béla Bollobás,et al.  Judicious partitions of bounded‐degree graphs , 2004, J. Graph Theory.

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

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

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

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

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

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

[11]  Sahar Karimi,et al.  Max-cut Problem , 2007 .

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

[13]  Noga Alon,et al.  Bipartite subgraphs , 1996, Comb..

[14]  Hossein Hajiabolhassan,et al.  A Note on the Hall-Condition Number of a Graph , 2000, Ars Comb..

[15]  Andrew U. Frank,et al.  How to orient the edges of a graph? in Combinatorics , 1976 .

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

[17]  Noga A Lon,et al.  MaxCut in H-Free Graphs , 2005 .

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

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

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