References
- Aigner, M., Ziegler, G. (2004). Proofs from THE BOOK. Berlin-Heidelberg: Springer-Verlag.
- Andrásfai, B., Erdős, P., Sós, V. T. (1974). On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math. 8(3): 205–218. DOI: 10.1016/0012-365X(74)90133-2.
- Füredi, Z., Kündgen, A. (2002). Turán problems for integer-weighted graphs. J. Graph Theory. 40(4): 195–225. DOI: 10.1002/jgt.10012.
- Mantel, M. (1907). Problem 28. Wiskundige Opgaven. 10: 60–61.
- Mubayi, D., Pikhurko, O. (2007). A new generalization of Mantel’s theorem to k-graphs. J. Comb. Theory Ser. B. 97(4): 669–678. DOI: 10.1016/j.jctb.2006.11.003.
- Turán, P. (1941). On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok. 48: 436–452.
- Turán, P. (1961). Research problem. Közl. MTA Mat. Kutató Int. 6: 177–181.
- van Lint, J. H., Wilson, R. M. (2001). A Course in Combinatorics, 2nd ed. Cambridge: Cambridge Univ. Press.
- Mantel’s theorem. www.youtube.com/watch?v=WgddUjZVyj4