Abstract
A hexagon triple is a graph consisting of three triangles of the form (a, x, b), (b, y, c), and (c,z,a), where a, b, c, x, y, z are distinct. The triangle (a, b, c) is called the inside triangle and the triangles (a, x, b), (b,y,c), and (c, z, a) are called outside triangles. A 3k-fold hexagon triple system of order n is a pair (X, H), where H is an edge-disjoint collection of hexagon triples which partitions the edge set of 3kK n with vertex set X. Note that the outside triangles form a 3k-fold triple system. If the 3k-fold hexagon triple system (X, H) has the additional property that the inside triangles form a k-fold triple system, then (X, H) is said to be perfect. A covering of 3kK n with hexagon triples is a triple (X, H, P) such that: 1.3kK n has vertex set X. 2.P is a subset of E(λ K n) with vertex set X for some λ, and 3.H is an edge disjoint partition of E(3kK n)∪ P with hexagon triples. If P is as small as possible (X, H, P) is called a minimum covering of 3kK n with hexagon triples. If the inside triangles of the hexagon triples in H form a minimum covering of kK n with triangles, the covering is said to be perfect. A complete solution for the problem of constructing perfect 3k-fold hexagon triple system and perfect maximum packing of 3kK n with hexagon triples was given recently by the authors [2]. In this work, we give a complete solution of the problem of constructing perfect minimum covering of 3kK n with hexagon triples.
Similar content being viewed by others
References
I. J. Dejter, P. I. Rivera-Vega and A. Rosa, Invariants for 2–factorizations and cycle systems, J. Combin. Math. Combin. Comput., Vol. 16 (1994) pp. 129–152.
S. Küçükçifçi and C. C. Lindner, Perfect hexagon triple systems, Discrete Math. (to appear).
C. C. Lindner, K. T. Phelps and C. A. Rodger, The spectrum for 2–perfect 6–cycle systems, J. Combinatorial Theory, Ser. A, Vol. 57 (1991) pp. 76–85.
C. C. Lindner and E. J. Billington, The spectrum for lambda-fold 2–perfect 6–cycle systems, European Journal of Combinatorics, Vol. 13 (1992) pp. 5–14.
C. C. Lindner and C. A. Rodger, Design Theory, CRC Press, Boca Raton, FL (1997) p. 208.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kücçükcçİfcçİ, S., Lindner, C.C. Minimum Covering for Hexagon Triple Systems. Designs, Codes and Cryptography 32, 251–265 (2004). https://doi.org/10.1023/B:DESI.0000029228.76566.3e
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000029228.76566.3e