In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. In particular, we focus on graphs and hypergraphs without long cycles or long paths, extending famous results of Erdos and Gallai. Results include bounds on the size of such objects as well as stability theorems about the structure of extremal and almost extremal objects.
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.