1. Maxcut in H-free graphs;Alon;Combin. Probab. Comput.,2005
2. Cycles of even length in graphs;Bondy;J. Combin. Theory Ser. B,1974
3. C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, in: Proc. 2nd Czechoslovak Symposium on Graph Theory, 1975, pp. 167–181.
4. Some extremal properties of bipartite graphs;Edwards;Canad. J. Math.,1973
5. The size of the largest bipartite subgraphs;Erdős;Discrete Math.,1997