Finite partial quadruple systems can be finitely embedded

DOI10.1016/0012-365X(74)90130-7MaRDI QIDQ1211055zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3557801 (Why is no real title available?)
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• The completion of finite incomplete Steiner triple systems with applications to loop theory

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1211055)