𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some infinite families of large sets of Kirkman triple systems

✍ Scribed by Landang Yuan; Qingde Kang


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
145 KB
Volume
16
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A large set of Kirkman triple systems of order v, denoted by LKTS(v), is a collection {(X, B~i~) : 1 ≀ i ≀ vβ€‰βˆ’β€‰2}, where every (X,B~i~) is a KTS(v) and all B~i~ form a partition of all triples on X. Many researchers have studied the existence of LKTS(v) for a long time. In [13], the author introduced a conceptβ€”large set of generalized Kirkman systems (LGKS), which plays an important role in the discussion of LKTS. In this article, we give a new construction for LGKS and obtain some new results of LKTS, that is, there exists an LKTS(6__u__ + 3) for u = q^n^, where n β‰₯ 1, q ≑ 7 (mod 12) and q is a prime power. Β© 2007 Wiley Periodicals, Inc. J Combin Designs 16: 202–212, 2008


πŸ“œ SIMILAR VOLUMES


Some Infinite Families of Large Sets of
✍ B. Tayfeh-Rezaie πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 98 KB

A set of necessary conditions for the existence of a large set of t-designs, LS[N] (t, k, v), is N |( v&i k&i ) for i=0, 1, ..., t. We show that these conditions are sufficient for N=3, t=2, 3, or 4, and k 8.

Note on large sets of infinite steiner s
✍ Peter J. Cameron πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 250 KB πŸ‘ 1 views

Large sets of Steiner systems s ( t , k , n ) exist for all finite t and k with t < k and all infinite n. The vector space analogues exist over a field F for all finite t and k with f < R provided that either v or F is infinite, and n 1 2k -t + 1. This inequality is best possible. o 1995 John Wiley

On large sets of resolvable and almost r
✍ 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

The spectrum for large sets of disjoint
✍ Qing-De Kang; Jian-Guo Lei; Yan-Xun Chang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 369 KB πŸ‘ 1 views

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