This Is AuburnElectronic Theses and Dissertations

Show simple item record

On the existence of even and k-divisible-matchings


Metadata FieldValueLanguage
dc.contributor.advisorHoffman, Dean G.
dc.contributor.advisorRodger, Chrisen_US
dc.contributor.advisorJohnson, Peter D., Jr.en_US
dc.contributor.advisorBillor, Nedreten_US
dc.contributor.authorMoore, Emiliaen_US
dc.date.accessioned2008-09-09T21:12:35Z
dc.date.available2008-09-09T21:12:35Z
dc.date.issued2008-05-15en_US
dc.identifier.urihttp://hdl.handle.net/10415/4
dc.description.abstractThe concept of an an even matching was first introduced by Billington and Hoffman. They were used to find gregarious 4-cycle decompositions of $K_{8t(a),b}$ with a and b odd. Their paper contains even matchings of type $(\alpha^8,\beta)$ for $\alpha$, $\beta$ even and $0\leq \beta\leq 4\alpha$. This paper considers the necessary and sufficient conditions for the existence of even matchings as well as k-divisible matchings. We present a construction of even matchings and 3-divisible matchings of type $(a_1,a_2,\ldots,a_p)$ provided the necessary conditions are satisfied.en_US
dc.language.isoen_USen_US
dc.subjectMathematics and Statisticsen_US
dc.titleOn the existence of even and k-divisible-matchingsen_US
dc.typeDissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record