Thesis icon

Thesis

Extremal combinatorics, graph limits and computational complexity

Abstract:

This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature.

The d-dimensional hypercube is the graph with vertex set {0,1}d where two vertices are adjacent if they differ in exactly one coordinate. In Chapter 2 we obtain an upper bound on the 'saturation number' of Qm in Qd. Specifically, we show that for m ≥ 2 f...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Division:
MPLS
Department:
Mathematical Institute
Department:
University of Oxford
Role:
Author

Contributors

Department:
University of Oxford
Role:
Supervisor
Clarendon Fund More from this funder
Natural Sciences and Engineering Research Council of Canada More from this funder
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP