Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals

Nicholas Christo, Marcus Michelen

A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this prob…