arXiv:1901.02272 Abstract | arXiv Analytics

Published 2019-01-08Version 1

We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.

Categories: math.CO

Keywords: hypergraphic degree sequences, np-complete

Related articles: Most relevant | Search more

arXiv:1701.02764 [math.CO] (Published 2017-01-10)

Column subset selection is NP-complete

Yaroslav Shitov

arXiv:1711.08436 [math.CO] (Published 2017-11-22)

Shellability is NP-complete

arXiv:1907.02104 [math.CO] (Published 2019-07-03)

Testing k-planarity is NP-complete