Roberts, Barnaby
(2017)
Structure and randomness in extremal combinatorics.
PhD thesis, London School of Economics and Political Science.
Abstract
In this thesis we prove several results in extremal combinatorics from areas including Ramsey theory, random graphs and graph saturation. We give a random graph analogue of the classical Andr´asfai, Erd˝os and S´os theorem showing that in some ways subgraphs of sparse random graphs typically behave in a somewhat similar way to dense graphs. In graph saturation we explore a ‘partite’ version of the standard graph saturation question, determining the minimum number of edges in H-saturated graphs that in some way resemble H themselves. We determine these values for K4, paths, and stars and determine the order of magnitude for all graphs. In Ramsey theory we give a construction from a modified random graph to solve a question of Conlon, determining the order of magnitude of the size-Ramsey numbers of powers of paths. We show that these numbers are linear. Using models from statistical physics we study the expected size of random matchings and independent sets in d-regular graphs. From this we give a new proof of a result of Kahn determining which d-regular graphs have the most independent sets. We also give the equivalent result for matchings which was previously unknown and use this to prove the Asymptotic Upper Matching Conjecture of Friedland, Krop, Lundow and Markstrom. Using these methods we give an alternative proof of Shearer’s upper bound on off-diagonal
Ramsey numbers.
Actions (login required)
 |
Record administration - authorised staff only |
Download statistics
Download statistics