{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/115356"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/115356","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Variations of Turán's theorem","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms","abstract_has_math":false,"creators":["Clemen, Felix Christian"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Balogh, József","Kostochka, Alexandr V","Dey, Partha S","English, Sean"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-05","date_published":"2022-05","updated_at":"2026-07-22T22:24:54Z","subjects":["Graph Theory","Combinatorics"],"languages":["en","eng"],"rights":["Copyright 2022 Felix Clemen"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/115356","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Balogh, József","Kostochka, Alexandr V","Dey, Partha S","English, Sean"]},{"key":"dc:creator","label":"Author","values":["Clemen, Felix Christian"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-05","2022-04-11"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph Theory","Combinatorics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2022 Felix Clemen"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/115356"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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","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."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Variations of Turán's theorem"]}]}],"canonical_facts":{"dc:contributor":["Balogh, József","Kostochka, Alexandr V","Dey, Partha S","English, Sean"],"dc:creator":["Clemen, Felix Christian"],"dc:date":["2022-05","2022-04-11"],"dc:description":["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","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."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/115356"],"dc:language":["en","eng"],"dc:rights":["Copyright 2022 Felix Clemen"],"dc:subject":["Graph Theory","Combinatorics"],"dc:title":["Variations of Turán's theorem"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:54Z"}