Embedding Steiner triple systems in hexagon triple systems

被引：12

作者：

Lindner, C. C. ^{[1
]}

Quattrocchi, Gaetano ^{[2
]}

Rodger, C. A. ^{[1
]}

机构：

[1] Auburn Univ, Dept Math, Auburn, AL 36849 USA

[2] Univ Catania, Dipartimento Matemat, I-95125 Catania, Italy

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 02期

关键词：

Steiner triple systems; Embedding; 6-cycles;

D O I：

10.1016/j.disc.2007.12.040

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A hexagon triple is the graph consisting of the three triangles (triples) {a. b, c}, {c, d, e}, and {e, f, a}, where a, b, c, d, e, and f are distinct. The triple {a, c, e} is called an inside triple. A hexagon triple system of order n is a pair (X, H) where H is a collection of edge disjoint hexagon triples which partitions the edge set of K(n) with vertex set X. The inside triples form a partial Steiner triple system. We show that any Steiner triple system of order n can be embedded in the inside triples of a hexagon triple system of order approximately 3(n). (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：487 / 490

页数：4

共 8 条

[1] Minimum embedding of Steiner triple systems into (K4-e)-designs I
Colbourn, Charles J.
Ling, Alan C. H.
Quattrocchi, Gaetano
[J]. DISCRETE MATHEMATICS, 2008, 308 (22) : 5308 - 5311
[2] GIONFRIDDO L, 2006, B ICA, V48, P73
[3] Kirkman T.P., 1847, Cambridge and Dublin Math. J., V7, P191
[4] Perfect hexagon triple systems
Küçükçifçi, S
Lindner, CC
[J]. DISCRETE MATHEMATICS, 2004, 279 (1-3) : 325 - 335
[5] Lindner C. C., 1997, Design Theory
[6] Embedding Steiner triple systems into Steiner systems S(2,4,v)
Meszka, M
Rosa, A
[J]. DISCRETE MATHEMATICS, 2004, 274 (1-3) : 199 - 212
[7] MAXIMAL SUBSETS OF A GIVEN SET HAVING NO TRIPLE IN COMMON WITH A STEINER TRIPLE SYSTEM ON SET
SAUER, N
SCHONHEI.J
[J]. CANADIAN MATHEMATICAL BULLETIN, 1969, 12 (06): : 777 - &
[8] Skolem T., 1958, MATH SCAND, V6, P273

← 1 →