Extremal Graph Theory: Basic Results

Postgraduate Thesis uoadl:2838467 687 Read counter

Unit:
Κατεύθυνση Θεωρητικά Μαθηματικά
Library of the School of Science
Deposit date:
2018-12-24
Year:
2018
Author:
Vidali Nefeli
Supervisors info:
Θηλυκός Μ. Δημήτριος, Καθηγητής, Τμήμα Μαθηματικών, Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών
Original Title:
Extremal Graph Theory: Basic Results
Languages:
English
Translated title:
Extremal Graph Theory: Basic Results
Summary:
In this thesis, we take a general overview of extremal graph theory, investigating
common techniques and how they apply to some of the more celebrated results in
the field. The first chapter is an introduction to the subject and some preliminary
definitions and results. The second chapter concerns substructures in dense graphs
and focuses on important results such as Turán’s theorem, Szemerédi’s regularity
lemma and the Erdős-Stone-Simonovits theorem. The third chapter concerns substructures in sparse graphs and investigates conditions which force a graph to contain a certain minor or topological minor. The fourth and final chapter is an introduction to the extremal theory of r-uniform hypergraphs and consists of a presentation of results concerning the conditions which force them to contain a complete r-graph and a Hamiltonian cycle.
Main subject category:
Science
Keywords:
graph theory, extremal graph theory, Turán, Szemerédi
Index:
No
Number of index pages:
0
Contains images:
Yes
Number of references:
62
Number of pages:
85
Extremal_more.pdf (819 KB) Open in new window