The size of the largest bipartite subgraphs
It was proved by \textit{C. S. Edwards} [Can. J. Math. 25, 475-485 (1973; Zbl 0229.05129)] that every multigraph with \(e\) edges must contain a bipartite subgraph with at least \(\lceil e/2 + (\sqrt{8 e + 1} - 1)/8 \rceil\) edges. This paper provides a simpler proof for this result.
scientific article; zbMATH DE number 1110120
scientific article