The Metamorphosis of Maximum Packings of 2Kn with Triples into Maximum Packings of 2Kn with 4-cycles
Type of Degreedissertation
Mathematics and Statistics
MetadataShow full item record
In this work, the problem of constructing a maximum packing of 2Kn with triples having a metamorphosis into a maximum packing of 2Kn with 4-cycles is concluded by solving the problem for every n ≥ 11 such that n ≡ 2, 5, 8, or 11 (mod 12).