2012
DOI: 10.11650/twjm/1500406600
|View full text |Cite
|
Sign up to set email alerts
|

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 ≡ 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 or… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(28 citation statements)
references
References 1 publication
0
27
0
1
Order By: Relevance
“…As far as we know, this problem has been completely settled only when k = 3, 5 [8,10], k = 4, 6, 8 [12], and when k = 10, 14 or 2 4 t ≥ [9]. It is important to notice that, as a consequence of a general result proved in [14], condition (*) is sufficient whenever v is large enough with respect to k. These results seem to suggest the following.…”
Section: Introductionmentioning
confidence: 91%
See 3 more Smart Citations
“…As far as we know, this problem has been completely settled only when k = 3, 5 [8,10], k = 4, 6, 8 [12], and when k = 10, 14 or 2 4 t ≥ [9]. It is important to notice that, as a consequence of a general result proved in [14], condition (*) is sufficient whenever v is large enough with respect to k. These results seem to suggest the following.…”
Section: Introductionmentioning
confidence: 91%
“…Proof The existence of 3‐sun systems and 5‐sun systems has been solved in [10] and in [8], respectively. Hence we can suppose k7 and 2k<v<6k.…”
Section: It Is Sufficient To Solve 2kmentioning
confidence: 99%
See 2 more Smart Citations
“…Liang and Guo [10,11] gave the existence spectrum of a k-sun system of order v as k = 3, 4, 5, 6, 8 by using a recursive construction. Recently, Fu et al [6] investigate the problem of the decomposition of complete tripartite graphs into 3-suns and find the necessary and sufficient condition for the existence of a k-sun system of order v in [7,8].…”
Section: Introductionmentioning
confidence: 99%