Essential points of the n-cube subset partitioning characterisation

DOI10.1016/J.DAM.2013.07.015MaRDI QIDQ2434737zbMATH OpenOpenAlexFDO

Authors Hasmik Sahakyan

Publication date 7 February 2014

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

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

zbMATH Keywords

\(n\)-cubedegree sequencehypergraphmonotone Boolean function

Mathematics Subject Classification ID

Vertex degrees (05C07) Hypergraphs (05C65)

Recommendations

• An efficiently recognisable subset of hypergraphic sequences
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On 3-hypergraphs with equal degree sequences.
• Some NP-complete problems for hypergraph degree sequences
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition

Cites work

• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Numerical characterization of \(n\)-cube subset partitioning
• On 3-hypergraphs with equal degree sequences.
• Some NP-complete problems for hypergraph degree sequences
• The polytope of degree sequences of hypergraphs

Cited in

(5)

• An efficiently recognisable subset of hypergraphic sequences
• scientific article; zbMATH DE number 3150817 (Why is no real title available?)
• The splitting technique in monotone recognition
• Partial order and chain decomposition of the set of k-subsets
• New sufficient conditions on the degree sequences of uniform hypergraphs

This page was built for publication: Essential points of the \(n\)-cube subset partitioning characterisation

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