Embedding problems in graphs and hypergraphs
The first part of this thesis concerns perfect matchings and their generalisations. We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph, thereby answering a question of Hàn, Person and Schacht. We say that a graph \(G\) has a perfect \(H\)-packing (also c...
| Main Author: | |
|---|---|
| Published: |
University of Birmingham
2011
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.528582 |