Reconstruction of hypertrees

DOI10.2140/PJM.1985.118.565MaRDI QIDQ1065031zbMATH OpenOpenAlexFDO

Authors H. G. Senge

Publication date 1985

Published in Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.pjm/1102706461

zbMATH Keywords

hypertreesReconstruction Conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

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.

Recommendations

• Graph reconstruction from subgraphs
• scientific article; zbMATH DE number 3906535
• scientific article; zbMATH DE number 5287238
• Progress on the reconstruction conjecture
• Graph reconstruction -- some new developments

Cited in

(8)

• Fragmentation Trees Reloaded
• scientific article; zbMATH DE number 3865328 (Why is no real title available?)
• A note on non-reconstructible 3-hypergraphs
• scientific article; zbMATH DE number 2046068 (Why is no real title available?)
• scientific article; zbMATH DE number 1380585 (Why is no real title available?)
• Tree reconstruction from partial orders
• On the uniqueness of exact vertex extensions
• The double reconstruction conjecture about finite colored hypergraphs

This page was built for publication: Reconstruction of hypertrees

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