Taiwanese Journal of Mathematics

FROM STEINER TRIPLE SYSTEMS TO 3-SUN SYSTEMS

Abstract

An $n$-$sun$ is the graph with $2n$ vertices consisting of an $n$-cycle with $n$ pendent edges which form a 1-factor. In this paper we show that the necessary and sufficient conditions for the decomposition of complete tripartite graphs with at least two partite sets having the same size into $3$-suns and give another construction to get a $3$-sun system of order $n$, for $n\equiv 0,1,4,9$ (mod 12). In the construction we metamorphose a Steiner triple system into a $3$-sun system. We then embed a cyclic Steiner triple system of order $n$ into a $3$-sun system of order $2n-1$, for $n\equiv 1$ (mod 6).

Article information

Source
Taiwanese J. Math., Volume 16, Number 2 (2012), 531-543.

Dates
First available in Project Euclid: 18 July 2017

https://projecteuclid.org/euclid.twjm/1500406600

Digital Object Identifier
doi:10.11650/twjm/1500406600

Mathematical Reviews number (MathSciNet)
MR2892897

Zentralblatt MATH identifier
1242.05036

Subjects

Citation

Fu, Chin-Mei; Jhuang, Nan-Hua; Lin, Yuan-Lung; Sung, Hsiao-Ming. FROM STEINER TRIPLE SYSTEMS TO 3-SUN SYSTEMS. Taiwanese J. Math. 16 (2012), no. 2, 531--543. doi:10.11650/twjm/1500406600. https://projecteuclid.org/euclid.twjm/1500406600

References

• \item[1.] I. Anderson, Combinatorial Designs: Construction Methods, Ellis Horwood Limited, 1990.
• \item[2.] C. J. Colbourn and A. Rosa, Triple Systems, Charendom Press, Oxford, 1999.
• \item[3.] T. P. Kirkman, On a problem in combinatorics, Cambridge and Dublin Math. J., 2 (1987), 191-204.
• \item[4.] C. C. Lindner and C. A. Rodger, Design Theorey, CRC Press, 1997.
• \item[5.] W. D. Wallis, Combinatorial Design, Marcel Dekker, New York and Besel, 1988.
• \item[6.] J. X. Yin and B. S. Gong, Existence of $G$-designs with $\vert V(G)\vert =6$, Combinatorial designs and applications (Huangshan, 1988, pp. 201-218), Lecture Notes in Pure and Appl. Math., Vol. 126, Dekker, New York, 1990.