A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3

DOI10.1016/0097-3165(75)90046-1zbMath0304.05005OpenAlexW2007193450MaRDI QIDQ1216305

Charles C. Lindner

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90046-1

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Loops, quasigroups (20N05)

Related Items

Coloring Block Designs is NP-Complete, On the embedding of partial three path designs, Linear spaces with many small lines, Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves, Embedding coverings of 2-paths with 3-paths, Coloring Steiner Triple Systems, On deficiency problems for graphs, The Doyen-Wilson theorem extended to 5-cycles, Small embeddings for partial cycle systems of odd length, Small Embeddings of Partial Steiner Triple Systems, Embedding partial triple systems, Embedding partial extended triple systems and totally symmetric quasigroups, Embedding partial Latin squares in Latin squares with many mutually orthogonal mates, Completion and deficiency problems, The (7, 4)-Conjecture in Finite Groups, A construction of orthogonal arrays and applications to embedding theorems, Small embeddings for partial triple systems of odd index, The embedding of partial triple systems when 4 divides \(\lambda\), A polynomial embedding of pairs of orthogonal partial Latin squares, A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\), Embedding Factorizations for 3-Uniform Hypergraphs, Enclosings of \(\lambda \)-fold 4-cycle systems, A proof of Lindner's conjecture on embeddings of partial Steiner triple systems, On the groups of automorphisms of Steiner triple and quadruple systems, Steiner quadruple systems - a survey, Embedding partial 4-cycle systems of arbitrary index, Embeddings of partial Steiner triple systems, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Completing small partial triple systems, Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results, Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)

Cites Work

• On embedding incomplete symmetric Latin squares
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Unnamed Item