Thesis
Problems in extremal and probabilistic combinatorics
- Abstract:
-
In this thesis we consider some problems in extremal and probabilistic combinatorics.
In Chapter 2 we determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertices, and show that there is a unique graph that achieves this maximum. This answers a question of Tuza.
Let Qd denote the hypercube of dimension d. Given d ≥ m, a spanning subgraph G of Q...
Expand abstract
Actions
+ Engineering & Physical Sciences Research Council
More from this funder
- Funding agency for:
- Morrison, N
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
- UUID:
-
uuid:83970d50-71d0-4511-9545-5358c3073343
- Deposit date:
-
2018-04-18
Terms of use
- Copyright holder:
- Morrison, N; Scott, A; Noel, J; . Natasha Morrison. Alex Scott. Jonathan A Noel
- Copyright date:
- 2017
If you are the owner of this record, you can report an update to it here: Report update to this record