Director of Research (if dissertation) or Advisor (if thesis)
Balogh, József
Doctoral Committee Chair(s)
Kostochka, Alexandr V
Committee Member(s)
Dey, Partha S
English, Sean
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Graph Theory
Combinatorics
Abstract
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
