Reconstruction of hypergraphs from line graphs and degree sequences (2104.14863v1)

Abstract: In this paper we consider the problem to reconstruct a $k$-uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hyperedges containing any pair of vertices is bounded. Given an integer sequence, constructing a $k$-uniform hypergraph with that as its degree sequence is NP-complete. Here we show that for constant integer sequences the question can be answered in polynomial time using Baranyai's theorem.