This Is AuburnElectronic Theses and Dissertations

Show simple item record

Path Decompositions of the Kneser Graph


Metadata FieldValueLanguage
dc.contributor.advisorRodger, Chris
dc.contributor.advisorHoffman, Dean
dc.contributor.advisorJohnson, Peter
dc.contributor.advisorLindner, Curt
dc.contributor.authorWhitt, Thomas Richard, III
dc.date.accessioned2013-04-22T16:23:32Z
dc.date.available2013-04-22T16:23:32Z
dc.date.issued2013-04-22
dc.identifier.urihttp://hdl.handle.net/10415/3576
dc.description.abstractNecessary 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titlePath Decompositions of the Kneser Graphen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record