# Hypergraphic Degree Sequences are Hard

## TL;DR

This paper proves that determining whether a vector can be realized as the degree sequence of a 3-hypergraph is an NP-complete problem, highlighting computational complexity in hypergraph theory.

## Contribution

It establishes the NP-completeness of the hypergraphic degree sequence problem for 3-hypergraphs, a previously unresolved complexity question.

## Key findings

- Deciding hypergraphic degree sequences is NP-complete.
- The problem remains hard even for 3-hypergraphs.
- Provides complexity classification for hypergraph degree sequences.

## Abstract

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