1. Balogh, J., Clemen, F.C., Lavrov, M., Lidický, B., Pfender, F.: Making $${K}_{r+1}$$-free graphs $$r$$-partite. Comb. Probab. Comput. 30(4), 609–618 (2020)
2. Erdős, P.: Problems and results in graph theory and combinatorial analysis. In: Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), pp. 169–192. Congressus Numerantium, No. XV (1976)
3. Erdős, P.: Some old and new problems in various branches of combinatorics. Discret. Math. 165/166, 227–231 (1997). Graphs and combinatorics (Marseille, 1995)
4. Erdős, P., Faudree, R., Pach, J., Spencer, J.: How to make a graph bipartite. J. Combin. Theory Ser. B 45(1), 86–98 (1988)
5. Erdős, P., Győri, E., Simonovits, M.: How many edges should be deleted to make a triangle-free graph bipartite? In: Sets, Graphs and Numbers (Budapest, 1991). Colloquia Mathematica Societatis János Bolyai, vol. 60, pp. 239–263. North-Holland, Amsterdam (1992)