Use this URL to cite or link to this record in EThOS:
Title: Extremal problems on graphs, directed graphs and hypergraphs
Author: Townsend, Timothy Duncan
ISNI:       0000 0004 5370 9195
Awarding Body: University of Birmingham
Current Institution: University of Birmingham
Date of Award: 2016
Availability of Full Text:
Access from EThOS:
Access from Institution:
This thesis is concerned with extremal problems on graphs and similar structures. We first study degree conditions in uniform hypergraphs that force matchings of various sizes. Our main result in this area improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We then study connectivity conditions in tournaments that ensure the existence of partitions of the vertex set that satisfy various properties. In 1982 Thomassen asked whether every sufficiently strongly connected tournament T admits a partition of its vertex set into t vertex classes such that the subtournament induced on T by each class is strongly k-connected. Our main result in this area implies an affirmative answer to this question. Finally we investigate the typical structure of graphs and directed graphs with some forbidden subgraphs. We answer a question of Cherlin by finding the typical structure of triangle-free oriented graphs. Moreover, our results generalise to forbidden transitive tournaments and forbidden oriented cycles of any order, and also apply to digraphs. We also determine, for all k > 5, the typical structure of graphs that do not contain an induced 2k-cycle. This verifies a conjecture of Balogh and Butterfield.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics