On the existence of even and k-divisible-matchings
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hoffman, Dean G. | |
dc.contributor.advisor | Rodger, Chris | en_US |
dc.contributor.advisor | Johnson, Peter D., Jr. | en_US |
dc.contributor.advisor | Billor, Nedret | en_US |
dc.contributor.author | Moore, Emilia | en_US |
dc.date.accessioned | 2008-09-09T21:12:35Z | |
dc.date.available | 2008-09-09T21:12:35Z | |
dc.date.issued | 2008-05-15 | en_US |
dc.identifier.uri | http://hdl.handle.net/10415/4 | |
dc.description.abstract | The 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.iso | en_US | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | On the existence of even and k-divisible-matchings | en_US |
dc.type | Dissertation | en_US |
dc.embargo.length | NO_RESTRICTION | en_US |
dc.embargo.status | NOT_EMBARGOED | en_US |