Spanning hypertree

Spanning hypertree --- гиперкаркас.

A spanning hypertree of [math]\displaystyle{ H }[/math] is an undirected hypertree, [math]\displaystyle{ T_{R} = (V, E_{T}) }[/math], such that:

1. [math]\displaystyle{ E_{T} \subseteq E }[/math];

2. [math]\displaystyle{ (T_{e} \cup \{h_{e}\}) \not \subseteq R, \; \forall e \in (E \setminus E_{T}) }[/math].

Recall that [math]\displaystyle{ R }[/math] is the root set.