Hypertree
A hypergraph H is called a hypertree if it admits a host graph T such that T is a tree. In other words H is a hypertree if there exists a tree T such that every hyperedge of H is the set of vertices of a connected subtree of T. Hypertrees have also been called arboreal hypergraphs or tree hypergraphs.