Reconstruction of hypertrees
This paper considers an extension of a famous case of the Reconstruction Conjecture to hypergraphs. The Reconstruction Conjecture hypothesizes that if all subgraphs H-x obtained by deleting one vertex are given for an unknown graph H, then H can be uniquely determined. It is known that this conjecture is true for trees. In this paper, it is shown that the Reconstruction Conjecture is true for hypertrees, except for special type of chain. Note that removing a vertex in a hypergraph does not eliminate all vertices incident to that vertex.
scientific article; zbMATH DE number 3920525