Numerical characterization of \(n\)-cube subset partitioning

DOI10.1016/j.dam.2008.11.003zbMath1202.05009OpenAlexW1984526115MaRDI QIDQ1026122

Hasmik Sahakyan

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.003

zbMATH Keywords

hypergraphtomography(0,1)-matrices\(\mathbf n\)-cubepartition/projection

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)

Related Items (2)

Essential points of the \(n\)-cube subset partitioning characterisation ⋮ The splitting technique in monotone recognition

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• Some NP-complete problems for hypergraph degree sequences
• Contributions to the geometry of Hamming spaces
• On the computational complexity of reconstructing lattice sets from their \(X\)-rays
• The polytope of degree sequences of hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Numerical characterization of \(n\)-cube subset partitioning