In a Steiner triple system STS(v) = (V, B), for each pair {a, b} β V, the cycle graph G a,b can be defined as follows. The vertices of G a,b are V \ {a, b, c} where {a, b, c} β B. {x, y} is an edge if either {a, x, y} or {b, x, y} β B. The Steiner triple system is said to be perfect if the cycle gra
Some packings with Steiner triple systems
β Scribed by R.H.F. Denniston
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 997 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
To pattittrm, tnto oil ttme 2 Srciner
1. lntroductian
1 refer to 131 for the history of the problem. which goes back to 1850; in fxt, Caylcy [ I] showed that there is no packing of arder 7. The existence of a packi!ng of order 9 was discovered by Kirkman 141, and rectiscsvcred ?~erdI t imcs; but, until very recentJy , no packings of other r:>rders had been constructed. Howz;?ver, Schreiber [ 5 j and Wilson [ 7 ] have in&qxndenUy discovered a construction, for a packing of order p+ 2, which works whcncver the prime factors of y are all congruent to t 7 module 8, J had dealt with the eases where 13 = 23, 31, 47 before hearing crsf thi!t construction. Again, Teirlintik [ 61 has shown how to constrtrc t a packing of order 3u, when a packing of order u is given : J have not, accoE:dingIy, studied any orders 3u to which his result could be ap-plied+ Let us identify p of the crlement~ of Y with the integers mrrdulo p, and dcnoae rhe o&r fwcr elemr*nls i,)r A and 8. Let X be the permutstian of Y which Icaves A and B fixe& but adds I mod p to each integer. Therr A ggncrates a group, L ~iy, ofp permutaticlns of 8': and L stfso acts a5 a group of permutal ions an the set T af triads. Since p is divisible neither by 3 nor by J, lhe orbits into whiI:h L partitions T must all ;be of length p. ?j;uppose, then, that we havqz managed to co;nciCruct D Steiner triple qs;:itm S, takbrg just one triad from each orbit of 1:; It.8 S, be a Stiriner tri#e system. namely the image of 5 under X* , where s = 0. I+ . . . l p ... 1.
Then we sex5 al once that {2J,; will 'be a packing.
' But, when a solution to the pro&m has been found, o:?e dif@ufty remains: how iis the !oiution to be presented. so that a r&der may check that the conditions have been satisfied? It is thesome to pick ail the unordered pain out of a iist of t,r?&s. so as to verify that each appears just once. and that the list is 3 Steimr triple system. I therefore waste ' wd for a paif Iw, w + d) of irltegers mod p1 wheqti it is natwaS to take d froc2 the set D givers by 0 < d < #p. A triad of jintegers can be written
π SIMILAR VOLUMES
A Steiner triple system of order u is said to be k-transrotational if it admits an automorphism consisting of a fixed point, a transposition, and k cycles of length (u-3)/k. Necessary and sufficient conditions are given for the existence of l-and 2-transrotational Steiner triple systems.
Stinson, D.R., Y.J. Wei, Some results on quadrilaterals in Steiner triple systems, Discrete Mathematics 105 (1992) 207-219. In this paper, we study quadrilaterals in Steiner triple systems. We present two recursive constructions for Steiner triple systems having no quadrilaterals. We also consider
and v 15, a 3-chromatic Steiner triple system of order v all of whose 3-colorings are equitable. 1997 Academic Press ## 1. Introduction A Steiner triple system of order v (briefly STS(v)) is a pair (X, B), where X is a v-element set and B is a collection of 3-subsets of X (triples), such that eve