2000 character limit reached
Hypergraphic Degree Sequences are Hard (1901.02272v1)
Published 8 Jan 2019 in math.CO, cs.CC, and cs.DM
Abstract: We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.