Reconstruction of hypertrees
type: Item
instance of: scholarly article
title: Reconstruction of hypertrees
zbMATH Open document ID: 0576.05051
author: H. G. Senge
published in: Pacific Journal of Mathematics
publication date: 1985-01-01T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.pjm/1102706461
review text: 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.
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 3920525
zbMATH Keywords: Reconstruction Conjecture
zbMATH Keywords: hypertrees
reviewed by: Alan C. Tucker
MaRDI profile type: Publication
OpenAlex ID: W1995105848
DOI: 10.2140/PJM.1985.118.565
description: scientific article; zbMATH DE number 3920525