Reconstruction of hypertrees

Hans Georg Senge

Vol. 118 (1985), No. 2, 565–574

DOI: 10.2140/pjm.1985.118.565

Abstract

In this paper we show that with essentially only one exception, every hypertree can be reconstructed from the set of maximal partial hypertrees {T − E|E ∩ C≠∅}. The exceptional hypertrees are hyperchains of odd length {x₀,E₁,x₁,…,E_x,x_s}, where

Mathematical Subject Classification 2000

Primary: 05C60

Secondary: 05C65

Milestones

Received: 7 June 1984

Published: 1 June 1985