Partitions of combinatorial structures
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning of combinatorial structures. We begin by considering problems from the theory of graph cuts. It is well known that every graph has a cut containing at least half its edges. We conjecture that (except...
| Main Author: | |
|---|---|
| Published: |
London School of Economics and Political Science (University of London)
2009
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.645899 |