Continuous optimisation in extremal combinatorics
In this thesis we explore instances in which tools from continuous optimisation can be used to solve problems in extremal graph and hypergraph theory. We begin by introducing a generalised notion of hypergraph Lagrangian and use tools from the theory of nonlinear optimisation to explore some of its...
| Main Author: | |
|---|---|
| Published: |
London School of Economics and Political Science (University of London)
2017
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.722195 |