A construction for large sets of disjoint Kirkman triple systems

Authors:
Lijun Ji
Affiliations:
Department of Mathematics, Suzhou University, Suzhou, China 215006
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 7
Cited 2

A survey of Kirkman triple systems and related designs

Discrete Mathematics
Some new 2-resolvable Steiner quadruple systems

Designs, Codes and Cryptography
On large sets of disjoint Kirkman triple systems

Discrete Mathematics
Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systems

Discrete Mathematics
An improved product construction for large sets of Kirkman triple systems

Discrete Mathematics
Large sets of disjoint packings on 6k + 5 points

Journal of Combinatorial Theory Series A
A new existence proof for large sets of disjoint Steiner triple systems

Journal of Combinatorial Theory Series A

New results on large sets of Kirkman triple systems

Designs, Codes and Cryptography
Large sets of Kirkman triple systems and related designs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Steiner system S(t, k, v) is called i-resolvable, 0 i t, if its block set can be partitioned into S(i, k, v). In this paper, a 2-resolvable S(3, 4, v) is used to construct a large set of disjoint Kirkman triple systems of order 3v 驴 3 (briefly LKTS) and some new orders for LKTS are then obtained.