Access the full text.
Sign up today, get DeepDyve free for 14 days.
Junling Zhou, Yanxun Chang (2005)
Product constructions for large sets of resolvable MTSs and DTSsAustralas. J Comb., 33
Q. Kang, J. Lei (1996)
On large sets of resolvable and almost resolvable oriented triple systemsJournal of Combinatorial Designs, 4
Q. Kang, J. Lei (1993)
A completion of the spectrum for large sets of disjoint Mendelsohn triple systemsBulletin of the ICA, 9
Q. Kang, Z. Tian (2000)
Large sets of oriented triple systems with resolvabilityDiscret. Math., 212
R.H.F. Denniston (1979)
Four doubly resolvable complete 3-designArs Combin., 7
Shengyuan Zhang, Jian Zhu (2003)
An improved product construction for large sets of Kirkman triple systemsDiscret. Math., 260
R. Denniston (1979)
Further Cases of Double ResolvabilityJ. Comb. Theory, Ser. A, 26
J. Denes, A.D. Keedwell (1974)
Latin Square and their Applications
Q. Kang, Q. Chang, Y. Chang (1992)
A completion of the spectrum for large sets of disjoint transitive triple systemsJournal of Combin. Theory A, 60
J. Zhou, Y. Chang (2006)
Tripling construction for Large sets of resolvable directed triple systemsActa Mathematica Sinica, 22
Q. Kang, Yanxun Chang (1992)
A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple SystemsJ. Comb. Theory, Ser. A, 60
Junling Zhou, Yanxun Chang (2006)
Tripling Construction for Large Sets of Resolvable Directed Triple SystemsActa Mathematica Sinica, 22
R. Denniston (1974)
Sylvester's problem of the 15 schoolgirlsDiscret. Math., 9
R. Xu, Q. Kang (1997)
A construction for LRMTS(3v) and LRDTS(3v)J. Hebei Normal College, 2
L. Ji, J. Lei (2008)
Further results on large sets of Kirkman triple systemsDiscret. Math., 308
Q. Kang, J. Lei, Yanxun Chang (1994)
The spectrum for large sets of disjoint mendelsohn triple systems with any indexJournal of Combinatorial Designs, 2
L. Teirlinck (1973)
On the maximum number of disjoint Steiner triple systemsDiscret. Math., 6
J. Lei (2002)
On large sets of Kirkman systems with holesDiscret. Math., 254
Q. Kang (1996)
Large sets of resolvable MTS and DTS of orderspn + 2Journal of Combinatorial Designs, 4
J. Bermond, A. Germa, D. Sotteau (1979)
Resolvable Decomposition of KnJ. Comb. Theory, Ser. A, 26
J. Lei (2002)
On the large sets of Kirkman triple systemsDiscrete Math., 257
R. Denniston (1974)
Double resolvability of some complete 3-designsmanuscripta mathematica, 12
S. Zhang, Lie Zhu (2002)
Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systemsDiscret. Math., 247
J. Lei (2002)
On large sets of disjoint Kirkman triple systemsDiscret. Math., 257
In this paper, we first introduce a special structure that allows us to construct a large set of resolvable Mendelsohn triple systems of orders 2q + 2, or LRMTS(2q + 2), where q = 6t + 5 is a prime power. Using a computer, we find examples of such structure for t ∈ T = {0, 1, 2, 3, 4, 6, 7, 8, 9, 14, 16, 18, 20, 22, 24}. Furthermore, by a method we introduced in [13], large set of resolvable directed triple systems with the same orders are obtained too. Finally, by the tripling construction and product construction for LRMTS and LRDTS introduced in [2, 20, 21], and by the new results for LR-design in [8], we obtain the existence for LRMTS(v) and LRDTS(v), where v = $$ 12(t + 1)\prod\limits_{m_i \geqslant 0} {(2 \cdot 7^{m_i } + 1)} \prod\limits_{n_i \geqslant 0} {(2 \cdot 13^{n_i } + 1)} $$ and t ∈ T, which provides more infinite family for LRMTS and LRDTS of even orders.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Aug 6, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.