English

Hypergraphic Degree Sequences are Hard

Combinatorics 2020-12-08 v1 Computational Complexity Discrete Mathematics

Abstract

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

Keywords

Cite

@article{arxiv.1901.02272,
  title  = {Hypergraphic Degree Sequences are Hard},
  author = {Antoine Deza and Asaf Levin and Syed M. Meesum and Shmuel Onn},
  journal= {arXiv preprint arXiv:1901.02272},
  year   = {2020}
}
R2 v1 2026-06-23T07:05:55.400Z