2026-09-20T17:45:33Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/115356 2023-07-11 col_2142_5131 col_2142_16340 com_2142_5130 com_2142_16339 com_2142_8903

Balogh, József Kostochka, Alexandr V Dey, Partha S English, Sean 2022-05 application/pdf en text Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms The student, Felix Clemen, accepted the attached license on 2022-03-29 at 10:52. The student, Felix Clemen, submitted this Dissertation for approval on 2022-03-29 at 11:08. This Dissertation was approved for publication on 2022-04-11 at 07:23. DSpace SAF Submission Ingestion Package generated from Vireo submission #17559 on 2022-11-11 at 13:04:37 Variations of Turán's theorem Clemen, Felix Christian 2022-04-11 Graph Theory Combinatorics 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. Thesis eng https://hdl.handle.net/2142/115356 Copyright 2022 Felix Clemen Ph.D. Dissertation Mathematics University of Illinois at Urbana-Champaign Mathematics