Extremal problems for cycles in graphs and hypergraphs

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.

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

2019

Author dc:creator

• Luo, Ruth

Contributors dc:contributor

• Kostochka, Alexandr
• Balogh, Jozsef
• Tserunyan, Anush
• Lavrov, Mikhail

• cycles, paths, Berge cycles, Berge paths, Turan problems, hypergraphs, extremal combinatorics, graph theory, hypergraph theory

Statement dc:rights

• Copyright 2019 Ruth Luo

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/105633

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/105633