Maximal sets of triangle-factors onv = 6m vertices

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1998)6:4<235::AID-JCD2>3.0.CO;2-G" /><235::AID-JCD2>3.0.CO;2-G 10.1002/(SICI)1520-6610(1998)6:4<235::AID-JCD2>3.0.CO;2-GzbMath0924.05013OpenAlexW1999295162MaRDI QIDQ4222154

R. S. Rees

Publication date: 6 December 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1998)6:4<235::aid-jcd2>3.0.co;2-g

zbMATH Keywords

maximal settriangle-factors

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Maximal sets of Hamilton cycles inKn,n ⋮ Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\)

This page was built for publication: Maximal sets of triangle-factors onv = 6m vertices