2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem скачать в хорошем качестве

2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem

MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist:    • MIT 18.217 Graph Theory and Additive Combi...   Which triangle-free graph has the maximum number of edges given the number of vertices? Prof. Zhao shows the class Mantel's theorem, which says that the answer is a complete bipartite graph. He also discusses generalizations: Turán's theorem (for cliques) and the Erdős-Stone-Simonovits theorem (for general subgraphs). License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu