Variations of Turán's theorem

A fundamental result in extremal combinatorics is Turán's theorem: Every K_{r+1}-free graph G on n vertices has at most as many edges as the complete balanced n-vertex r-partite graph. In this thesis, we study several problems in extremal combinatorics focusing on variations of Turán's theorem.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2022

Author dc:creator

• Clemen, Felix Christian

Contributors dc:contributor

• Balogh, József
• Kostochka, Alexandr V
• Dey, Partha S
• English, Sean

• Graph Theory
• Combinatorics

Statement dc:rights

• Copyright 2022 Felix Clemen

Language dc:language

en, eng

Handle dc:identifier

https://hdl.handle.net/2142/115356

OAI record oai:identifier

https://www.ideals.illinois.edu/oai-pmh?verb=GetRecord&metadataPrefix=etdms&identifier=oai%3Awww.ideals.illinois.edu%3A2142%2F115356