Path Decompositions of the Kneser Graph
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Chris | |
| dc.contributor.advisor | Hoffman, Dean | |
| dc.contributor.advisor | Johnson, Peter | |
| dc.contributor.advisor | Lindner, Curt | |
| dc.contributor.author | Whitt, Thomas Richard, III | |
| dc.date.accessioned | 2013-04-22T16:23:32Z | |
| dc.date.available | 2013-04-22T16:23:32Z | |
| dc.date.issued | 2013-04-22 | |
| dc.identifier.uri | http://hdl.handle.net/10415/3576 | |
| dc.description.abstract | Necessary and sufficient conditions are given for the existence of a graph decomposition of the Kneser Graph $KG_{n,2}$ into paths of length three and four, and of the Generalized Kneser Graph $GKG_{n,3,1}$ into paths of length three. A solution is also presented for the problem of embedding maximal $H$-designs, where $H$ is a path of length three. | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Path Decompositions of the Kneser Graph | en_US |
| dc.type | dissertation | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |