abstract
- We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
Hypergraphic Degree Sequences are Hard
Journal Articles
- Overview
- Research
- View All
Overview
authors
publication date
- January 8, 2019