 Balanced random cut lower bound

If a graph has even order $n$ and $m$ edges, it has a cut with equally sized parts and at leastcrossing edges. Choose one part uniformly among the $n/2$-vertex subsets. A fixed edge is separated with probabilityand apply linearity of expectation.