论文信息 - Embedding Partial Steiner Triple Systems

Embedding Partial Steiner Triple Systems

We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Steiner triple system of order n with v triples then there is an equitable partial Steiner triple system of order n with v triples. This result, interesting in itself, is used in the proof of the above theorems.

[1] H. Abbott,et al. AN EXTREMAL PROBLEM IN GRAPH THEORY , 1980 .

[2] D. de Werra. Equitable colorations of graphs , 1971 .

[3] Charles C Lindner,et al. Finite embedding theorems for partial designs and algebras , 1977 .

[4] Christine Treash. The completion of finite incomplete Steiner triple systems with applications to loop theory , 1971 .

[5] A. Hilton,et al. On Steiner and Similar Triple Systems. , 1969 .

[6] Richard M. Wilson,et al. Embeddings of Steiner triple systems , 1973, Discret. Math..

[7] Allan B. Cruse,et al. On Embedding Incomplete Symmetric Latin Squares , 1974, J. Comb. Theory, Ser. A.

[8] Charles C. Lindner. A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3 , 1975, J. Comb. Theory, Ser. A.

[9] Paul Erdös,et al. On an extremal problem in graph theory , 1970 .

[10] Prince Camille de Polignac. On a Problem in Combinations , 1866 .