On bisections of directed graphs

If the underlying graph of D does not contain cycles of length 4, then we show that D admits a bisection V(D)=V1∪V2 such that min{e(V1,V2),e(V2,V1)}≥(1/4+o(1))m.