Hypergraphic Degree Sequences are Hard
arXiv:1901.02272
Abstract
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
arXiv:1901.02272
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.