Almost Resolvable Maximum Packings of Complete Bipartite Graphs with 4-Cycles
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Hoffman, Dean | |
| dc.contributor.author | Ohlson, Vicky | |
| dc.date.accessioned | 2012-07-17T18:33:24Z | |
| dc.date.available | 2012-07-17T18:33:24Z | |
| dc.date.issued | 2012-07-17 | |
| dc.identifier.uri | http://hdl.handle.net/10415/3213 | |
| dc.description.abstract | A packing of a complete bipartite graph K(m,n) with 4-cycles is a decomposition of K(m,n) into a collection C of edge-disjoint 4-cycles and a set of unused edges L referred to as the leave. If C is as large as possible (and L is as small as possible), then the packing is a maximum packing. An almost parallel class of a maximum packing is a largest possible set of vertex disjoint 4-cycles. In this paper we establish values of m and n for which a maximum packing of K(m,n) with 4-cycles may be resolved into almost parallel classes with the remaining cycles vertex disjoint. | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Almost Resolvable Maximum Packings of Complete Bipartite Graphs with 4-Cycles | en_US |
| dc.type | dissertation | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |