Reconstruction of hypergraphs from line graphs and degree sequences

Authors Amitava Bhattacharya, Aloysius Godinho, Pritam Majumder, N. M. Singhi

Publication date 30 April 2021

Flows in graphs (05C21) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

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.

This page was built for publication: Reconstruction of hypergraphs from line graphs and degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366508)