The Intersection Problem for Maximum Packings of the Complete Graph with 4-Cycles
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Lindner, Charles | |
| dc.contributor.author | Cortez, Joseph | |
| dc.date.accessioned | 2020-05-11T13:28:16Z | |
| dc.date.available | 2020-05-11T13:28:16Z | |
| dc.date.issued | 2020-05-11 | |
| dc.identifier.uri | http://hdl.handle.net/10415/7179 | |
| dc.description.abstract | A maximum packing of K_n with 4-cycles may leave some edges of the graph unpacked. The size of the leave is determined by the congruence class of n modulo 8. When n ≡ 1 (mod 8) the packing coincides with a 4-cycle system of K_n. Billington (J. Combin. Des. 1 (1993) 435-452) has solved the intersection problem for 4-cycle systems. In this dissertation we complete the solution for maximum packings with 4-cycles by solving the cases where n 6≡ 1 (mod 8). | en_US |
| dc.rights | EMBARGO_GLOBAL | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | The Intersection Problem for Maximum Packings of the Complete Graph with 4-Cycles | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.length | MONTHS_WITHHELD:24 | en_US |
| dc.embargo.status | EMBARGOED | en_US |
| dc.embargo.enddate | 2022-05-08 | en_US |