Hypergraphic Degree Sequences are Hard

Abstract

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

Authors

Deza A; Levin A; Meesum SM; Onn S

Bulletin of the European Association for Theoretical Computer Science, 127:63-64, 2019, , ,

January 8, 2019

Antoine Deza