[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/JKMS.2008.45.5.1243

A CONSTRUCTION OF ONE-FACTORIZATION

Choi, Yoon-Young (Department of Mathematic Sogang University)
Kim, Sang-Mok (Division of General Education-Mathematics Kwangwoon University)
Lim, Seon-Ju (Department of Mathematics & Statistics Sookmyung Women's University)
Park, Bong-Joo (Combinatorics21)

Publication Information

Journal of the Korean Mathematical Society / v.45, no.5, 2008 , pp. 1243-1253 More about this Journal

Abstract

In this paper, we construct one-factorizations of given complete graphs of even order. These constructions partition the edges of the complete graph into one-factors and triples. Our new constructions of one-factors and triples can be applied to a recursive construction of Steiner triple systems for all possible orders ${\geq}$ 15.

Keywords

one-factorizations; Steiner triple systems;

Citations & Related Records

Times Cited By Web Of Science : 0 (Related Records In Web of Science)
Times Cited By SCOPUS : 0

Reference

1	L. D. Andersen, Factorizations of graphs, in : CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz (eds), CRC Press, Boca Raton, FL, 1996, 653-667
2	W. D. Wallis, One-factorizations, Mathematics and its Applications, 390. Kluwer Academic Publishers Group, Dordrecht, 1997
3	W. D. Wallis, One-factorizations of the complete graph, in : Contemporary Design Theory : A Collection of Surveys, J. H. Dinitz and D. R. Stinson (eds), Wiley, New York, 1992, 593-631
4	R. G. Stanton and I. P. Goulden, Graph factorization, general triple systems, and cyclic triple systems, Aequationes Math. 22 (1981), no. 1, 1-28 DOI
5	C. J. Colbourn and A. Rosa, Triple Systems, Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, 1999
6	J. Doyen and R. M. Wilson, Embeddings of Steiner triple systems, Discrete Math. 5 (1973), 229-239 DOI ScienceOn
7	A. Hartman, Tripling quadruple systems, Ars Combin. 10 (1980), 255-309
8	E. Mendelsohn and A. Rosa, One-factorizations of the complete graph-a survey, J. Graph Theory 9 (1985), no. 1, 43-65 DOI
9	M. Reiss, Uber eine Steinersche combinatorische Aufgabe, welche im 45sten Banden dises Journals, Seite 181, gestellt worden ist, J. Reine Angew Math. 65 (1859), 226-244
10	G. Stern and H. Lenz, Steiner triple systems with given subspaces; another proof of the Doyen-Wilson-theorem, Boll. Un. Mat. Ital. A (5) 17 (1980), no. 1, 109-114