Finite partial quadruple systems can be finitely embedded

DOI10.1016/0012-365X(74)90130-7zbMath0291.05018OpenAlexW2038896524MaRDI QIDQ1211055

Bernhard Ganter

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90130-7

Mathematics Subject Classification ID

Other designs, configurations (05B30) Algebraic structures (08Axx)

Related Items

Construction of Steiner quadruple systems having a prescribed number of blocks in common ⋮ 2-chromatic Steiner quadruple systems ⋮ Completion and deficiency problems ⋮ A construction of orthogonal arrays and applications to embedding theorems ⋮ Embedding in a perfect code ⋮ Disjoint finite partial Steiner triple systems can be embedded in disjoint finite Steiner triple systems ⋮ A finite embedding theorem for partial Steiner 3-designs ⋮ Finite embedding theorems for partial Steiner triple systems ⋮ Equational classes of Steiner systems ⋮ A finite partial idempotent latin cube can be embedded in a finite idempotent latin cube ⋮ Two finite embedding theorems for partial 3-quasigroups ⋮ Steiner quadruple systems - a survey ⋮ On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems ⋮ Combinatorial designs and perfect codes ⋮ Embedding in \(q\)-ary 1-perfect codes and partitions

Cites Work

• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Unnamed Item

This page was built for publication: Finite partial quadruple systems can be finitely embedded