A Method of Constructing Steiner Triple System of Order 2t+1

Article Preview

Abstract:

The basic concept of constructing the Steiner triple systems of order is described. The detinition of edges matrix of the complete graph is given. A method of constructing Steiner triple system of order is proposed. The errtire procedure of constructing Steiner triple systems of orderand is presented respectively, The enumeration problem of Steiner triple systems of order is discussed [1-1.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2995-2998

Citation:

Online since:

February 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Richard A. bruald. Introductory Combinatorics[M]. Amsterdam: North-Holland Publishing Company, (1997).

Google Scholar

[2] J.H. vanLint, R.M. Wilson. A Course in Combinatorics[M]. Beijing: China Machine Press, (2004).

Google Scholar

[3] CHOU Wan-xi. A Method of Constructing Kirkman Triple System of Order[J]. Mathematics In Practice and Theory, 2004, 34(9): 144-150.

Google Scholar

[4] TIAN Jin-ting, ZHANG Ying-shan, ZHANG Xiao-qin. The Comparison and Application of Balanced Block Orthogonal Arrays and Orthogonal Arrays[J]. Mathematics in Practice and Theory, 2009, 39(22): 59-67.

Google Scholar

[5] H. Cao, Y. Tang. On Kirkman packing designs KPD({3, 4}, v)[J]. Discrete Mathematics, 2004, 279(1-3): 121-133.

DOI: 10.1016/s0012-365x(03)00263-2

Google Scholar

[6] K. Daniel, M. Edita, P. Attila, J.S. Sereni. Characterization of affine Steiner triple systems and Hall triple systems[J]. Electronic Notes in Discrete Mathematics, 2007, 29: 17-21.

DOI: 10.1016/j.endm.2007.07.004

Google Scholar

[7] Zhang S, Zhu L. An improved product construction for large sets of Kirkman triple systems[J]. Discrete mathematics, 2003, 260(1): 307-313.

DOI: 10.1016/s0012-365x(02)00766-5

Google Scholar

[8] Hurd S P, Sarvate D G. An application of partition of indices to enclosings of triple systems[J]. Discrete Mathematics, 2003, 261(1): 337-346.

DOI: 10.1016/s0012-365x(02)00478-8

Google Scholar

[9] Luo Chun, Pan Changyuan. Method of Exhaustion to Search Orthogonal Balanced Block Designs[J]. Applied Probability and Statistics, 2011, 27(1): 1-13.

Google Scholar

[10] Jia-Xi L. On large sets of disjoint Steiner triple systems, VI[J]. Journal of Combinatorial Theory, Series A, 1984, 37(2): 189-192.

DOI: 10.1016/0097-3165(84)90068-2

Google Scholar

[11] Teirlinck L. A completion of Lu's determination of the spectrum of large sets of disjoint Steiner triple systems[J]. J. Combin. Theory (A), 1991, 57: 302-305.

DOI: 10.1016/0097-3165(91)90053-j

Google Scholar

[12] Ji L. A new existence proof for large sets of disjoint Steiner triple systems[J]. J. Combin. Theory(A), 2005, 112: 308-327.

DOI: 10.1016/j.jcta.2005.06.005

Google Scholar

[13] A. Forbes, M. Grannell, T. Griggs, On 6-sparse Steiner triple systems, Journal of Combinatorial Theory, Series A, Vol. 114, No. 2, 235-252, (2007).

DOI: 10.1016/j.jcta.2006.04.003

Google Scholar

[14] J. Zhou, Y. Chang, Existence of good large sets of Steiner triple systems, Discrete Mathematics, Vol. 309, No. 12, 3930-3935, (2009).

DOI: 10.1016/j.disc.2008.11.008

Google Scholar