Packings and coverings with Hamilton cycles and on-line Ramsey theory
A major theme in modern graph theory is the exploration of maximal packings and minimal covers of graphs with subgraphs in some given family. We focus on packings and coverings with Hamilton cycles, and prove the following results in the area. • Let ε > 0, and let \(G\) be a large graph on n vert...
| Main Author: | |
|---|---|
| Published: |
University of Birmingham
2014
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.633348 |