[4] Bollobás, B., Scott, A. D.:
Better bounds for Max Cut. Contemporary Combinatorics B. Bollobás Bolyai Soc. Math. Stud. 10, János Bolyai Math. Soc., Budapest (2002), 185-246.
MR 1919571 |
Zbl 1014.90082
[7] Edwards, C. S.:
An improved lower bound for the number of edges in a largest bipartite subgraph. Recent Advances in Graph Theory Proc. Symp., Praha 1974, Academia, Praha (1975), 167-181.
MR 0398888 |
Zbl 0326.05115
[16] Scott, A.:
Judicious partitions and related problems. Surveys in Combinatorics B. Webb Conf. Proc., Durham, 2005, London Mathematical Society Lecture Note Series 327, Cambridge University Press, Cambridge (2005), 95-117.
DOI 10.1017/CBO9780511734885 |
MR 2187736 |
Zbl 1110.05084