Numerical characterisation of n-cube subset partitioning

DOI10.1016/J.ENDM.2006.08.027MaRDI QIDQ3439501zbMATH OpenOpenAlexFDO

Authors L. Aslanyan, Hasmik Sahakyan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.08.027

zbMATH Keywords

\(n\)-cubetomography

Mathematics Subject Classification ID

Partitions of sets (05A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Euclidean geometries (general) and generalizations (51M05)

Recommendations

• Numerical characterization of \(n\)-cube subset partitioning
• Partitioning the n-cube into sets with mutual distance 1
• On partitions of an n-cube into perfect binary codes
• Equipartition sets of hypercubes. II
• Matchings and paths in the cube

Cites work

• scientific article; zbMATH DE number 4200248 (Why is no real title available?)
• The polytope of degree sequences of hypergraphs

Cited in

(3)

• Numerical characterization of \(n\)-cube subset partitioning
• The splitting technique in monotone recognition
• Discrete tomography problems with paired projections and complexity characteristics

This page was built for publication: Numerical characterisation of n-cube subset partitioning

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