Thesis
Sidorenko's conjecture, graph norms, and pseudorandomness
- Abstract:
-
This thesis is primarily concerned with correlation inequalities between the number of homomorphic copies of different graphs. In particular, many of the results relate to a beautiful conjecture of Sidorenko, which roughly states that the number of copies of a bipartite graph H in a graph G is asymptotically minimised when G is the Erdos Reyni random graph.
The first part of the thesis discusses recent approaches to attack Sidorenko's conjecture. We firstly prove that every gr...
Expand abstract
Actions
Funding
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Subjects:
- UUID:
-
uuid:5666a58e-77ae-4709-a41e-587cf176840a
- Deposit date:
- 2018-07-08
Terms of use
- Copyright holder:
- Lee, J
- Copyright date:
- 2017
If you are the owner of this record, you can report an update to it here: Report update to this record