Topics in extremal graph theory and probabilistic combinatorics
This thesis considers a variety of problems in Extremal Graph Theory and Probabilistic Combinatorics. Most of these problems are structural in nature, but some concern random reconstruction and parking problems.
A matching in a bipartite graph G = (U, V, E) is a subset of the edges where no two edges meet, and each vertex from U is in an edge. A classical result is Hall’s Theorem  which gives necessary and sucient conditions for the existence of a matching. In Chap...Expand abstract
+ Scott, A
Mathematical Institute, University of Oxford. Merton College, University of Oxford.
+ Przykucki, M
School of Mathematics, University of Birmingham
+ Morrison, N
Centre for Mathematics, University of Cambridge. Sidney Sussex College, University of Cambridge.
+ McDiarmid, C
Department of Statistics, University Oxford. Corpus Christi College, University of Oxford.
+ Pikhurko, O
Mathematics Institute, University of Warwick.
+ Engineering & Physical Sciences Research Council More from this funder
Funding agency for:
- Type of award:
- Level of award:
- Awarding institution:
- University of Oxford
- Deposit date:
- Copyright holder:
- Roberts, A
- Copyright date:
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record