✦ LIBER ✦

Existence of non-resolvable Steiner triple systems

✍ Scribed by (Ben) Pak Ching Li; G. H. J. van Rees

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 112 KB
Volume: 13
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20027

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We consider two well‐known constructions for Steiner triple systems. The first construction is recursive and uses an STS(v) to produce a non‐resolvable STS(2__v__ + 1), for v ≡ 1 (mod 6). The other construction is the Wilson construction that we specify to give a non‐resolvable STS(v), for v ≡ 3 (mod 6), v > 9. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 16–24, 2005.

📜 SIMILAR VOLUMES

Embeddings of Resolvable Triple Systems

✍ Hao Shen; Yizhu Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Let RB(3, \*; v) denote a resolvable \*-fold triple system of order v. It is proved in this paper that the necessary and sufficient conditions for the embedding of an RB(3, \*; v) in an RB(3, \*; u) are u 3v and (i) u#v#3 (mod 6) if \*#1 (mod 2), (ii) u#v#3 (mod 3) if \*#0 (mod 4), or (iii) u#v#0 (m

Support sizes of threefold resolvable tr

Support sizes of threefold resolvable triple systems

✍ Yanxun Chang; Giovanni Lo Faro; Hao Shen 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Let __SS__~__R__~(__v__, 3) denote the set of all integer __b__\* such that there exists a __RTS__(__v__, 3) with __b__\* distinct triples. In this paper, we determine the set __SS__~__R__~(__v__, 3) for __v__ ≡ 3 (mod 6) and __v__ ≥ 3 with only five undecided cases. We establish that _

On large sets of resolvable and almost r

On large sets of resolvable and almost resolvable oriented triple systems

✍ Qingde Kang; Jianguo Lei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

An MTS(v) [or DTS(v)] is said to be resolvable, denoted by RMTS(v) [or RDTS(v)], if its block set can be partitioned into parallel classes. An MTS(v) [or DTS(v)] is said to be almost resolvable, denoted by ARMTS(v) [or ARDTS(v)], if its bloak set can be partitioned into almost parallel classes. The

Surface embeddings of Steiner triple sys

Surface embeddings of Steiner triple systems

✍ M. J. Grannell; T. S. Griggs; Jozef S˘irán˘ 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB 👁 1 views

A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-colored (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks

Ternary codes of steiner triple systems

✍ J. D. Key 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

The code over a finite field F, of a design D is the space spanned by the incidence vectors of the blocks. It is shown here that if D is a Steiner triple system on v points, and if the integer then the ternary code C of contains a subcode that can be shortened to the ternary generalized Reed-Muller

Quasi-embeddings of Steiner triple syste

Quasi-embeddings of Steiner triple systems, or Steiner triple systems of different orders with maximum intersection

✍ Peter Dukes; Eric Mendelsohn 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

## 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