Back to search

University of Birmingham

Local approaches to global problems in extremal combinatorics

Abstract

dc:description.abstract

In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds. We show that as soon as they appear, we can also find rainbow copies of Perfect Matchings, H-factors and Hamilton cycles in large graphs. We then look to random digraphs and consider the D(n, p) model in which each edge is present independently with probability p. We find tail bounds on the size of the largest strongly connected component in the critical window around p = 1/n. Finally, we consider the partition function of the ferromagnetic Potts model on graphs of bounded maximum degree. We show that there exists an open set in C containing an interval [1, w] inside which the partition function has no zeros.

Degree

thesis:*
Name dc:type.qualificationname
d_ph
Level dc:type.qualificationlevel
d_ph
Grantor dc:publisher.institution
University of Birmingham
Year dc:date.issued
2020

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Coulson, Matthew

Subjects

dc:subject × 1

Rights

Language dc:language.dcterms_iso639_2
eng

Chain of custody

source
Harvested from
University of Birmingham
Base URL
etheses.bham.ac.uk/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Coulson, Matthew. Local approaches to global problems in extremal combinatorics. d_ph thesis, University of Birmingham, 2020.