Thesis
Topics in extremal graph theory and probabilistic combinatorics
- Abstract:
-
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 [30] which gives necessary and sucient conditions for the existence of a matching. In Chap...
Expand abstract
Actions
Authors
Contributors
+ Scott, A
Department:
Mathematical Institute, University of Oxford. Merton College, University of Oxford.
Role:
Contributor, Supervisor
+ Przykucki, M
Department:
School of Mathematics, University of Birmingham
Role:
Contributor
+ Morrison, N
Department:
Centre for Mathematics, University of Cambridge. Sidney Sussex College, University of Cambridge.
Role:
Contributor
+ McDiarmid, C
Department:
Department of Statistics, University Oxford. Corpus Christi College, University of Oxford.
Role:
Examiner
+ Pikhurko, O
Department:
Mathematics Institute, University of Warwick.
Role:
Examiner
Funding
+ Engineering & Physical Sciences Research Council
More from this funder
Funding agency for:
Roberts, A
Grant:
1499791
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:0c91c4de-456e-4e3f-b1d1-aa0516e70f1c
- Deposit date:
- 2019-07-15
Related Items
Terms of use
- Copyright holder:
- Roberts, A
- Copyright date:
- 2018
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record