Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs IV
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Christopher | |
| dc.contributor.author | Tidwell, David | |
| dc.date.accessioned | 2021-12-06T15:07:44Z | |
| dc.date.available | 2021-12-06T15:07:44Z | |
| dc.date.issued | 2021-12-06 | |
| dc.identifier.uri | https://etd.auburn.edu//handle/10415/8047 | |
| dc.description.abstract | Finding the values of s for which there exists a maximal set of s edge-disjoint Hamilton cycles in the complete multipartite graph K_n^p has been considered in papers for over 20 years. This paper finally settles the problem by finding such a set in the last remaining open case, namely where s is as small as possible (so its existence was still in doubt) when n = 3 and the number of parts, p, is 3 (mod 4). | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs IV | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |
| dc.embargo.enddate | 2021-12-06 | en_US |
| dc.creator.orcid | 0000-0003-1343-9103 | en_US |