Old Web
Hypergraphic Degree Sequences are Hard
2019
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
1
References
0
Citations
NaN
KQI