The completion of finite incomplete Steiner triple systems with applications to loop theory
From MaRDI portal
Publication:2546203
DOI10.1016/0097-3165(71)90030-6zbMath0217.02001OpenAlexW2011671869MaRDI QIDQ2546203
Publication date: 1971
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(71)90030-6
Related Items
Infinite linear spaces ⋮ 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 ⋮ 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 ⋮ On completing partial Latin squares with prescribed diagonals ⋮ Embedding partial extended triple systems and totally symmetric quasigroups ⋮ Embedding an incomplete diagonal latin square in a complete diagonal latin square ⋮ Completion and deficiency problems ⋮ Model theory of Steiner triple systems ⋮ 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 partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\) ⋮ Embedding in a perfect code ⋮ Finite partial quadruple systems can be finitely embedded ⋮ On the number of 1-factorizations of the complete graph ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ Disjoint finite partial Steiner triple systems can be embedded in disjoint finite Steiner triple systems ⋮ A finite embedding theorem for partial Steiner 3-designs ⋮ A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 ⋮ Finite embedding theorems for partial Steiner triple systems ⋮ Strong finite embeddability for classes of quasigroups ⋮ Finite embeddability in a class of infinitary algebras ⋮ Intersection preserving finite embedding theorems for partial quasigroups ⋮ Totally symmetric and semi-symmetric quasigroups have the intersection preserving finite embeddability property ⋮ A proof of Lindner's conjecture on embeddings of partial Steiner triple systems ⋮ Steiner quadruple systems - a survey ⋮ Finite embedding theorems for partial pairwise balanced designs ⋮ Projective, affine, and abelian colorings of cubic graphs ⋮ Embedding partial idempotent Latin squares ⋮ Finite partial cyclic triple systems can be finitely embedded ⋮ Embeddings of partial Steiner triple systems ⋮ Finite embedding theorems for partial Latin squares, quasi-groups, and loops ⋮ Embedding partial Steiner triple systems is NP-complete ⋮ 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\) ⋮ Combinatorial designs and perfect codes ⋮ Embedding in \(q\)-ary 1-perfect codes and partitions
Cites Work
This page was built for publication: The completion of finite incomplete Steiner triple systems with applications to loop theory
