The existence of incomplete Steiner triple systems of order v having holes of orders w and u meeting in z elements is examined, with emphasis on the disjoint (z 0) and intersecting (z 1) cases. When w ! u and v 2w u ร 2z, the elementary necessary conditions are shown to be sufยฎcient for all values o
Steiner triple systems with two disjoint subsystems
โ Scribed by Darryn Bryant; Daniel Horsley
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 123 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u,w, and v are odd, ${{v}\choose 2}-{u\choose 2}- {w\choose 2}\equiv 0$ (mod 3), and ${v}\ge w + u +{\rm max} { u,w}$. Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v โ u โ w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the wellโknown theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. ยฉ 2005 Wiley Periodicals, Inc. J Combin Designs
๐ SIMILAR VOLUMES
## Abstract A 2โclass regular partial Steiner triple system is a partial Steiner triple system whose points can be partitioned into 2โclasses such that no triple is contained in either class and any two points belonging to the same class are contained in the same number of triples. It is uniform if
## Abstract In this paper, we present a conjecture that is a common generalization of the DoyenโWilson Theorem and Lindner and Rosa's intersection theorem for Steiner triple systems. Given __u__, __v__ โก 1,3 (mod 6), __u__ < __v__ < 2__u__โ+โ 1, we ask for the minimum __r__ such that there exists a
Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g 1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g 2, 3, 4, 9. In this paper, by introducing a spec
The spectrum for LMTS(v, 1) has been obtained by Kang and Lei (Bulletin of the ICA, 1993). In this article, firstly, we give the spectrum for LMTS(v,3). Furthermore, by the existence of LMTS(v, 1) and LMTS(v, 3), the spectrum for LMTS(v, A) is completed, that is Y = 2 (mod A), v 2 A + 2, if A # 0 (m