Articulation set

Articulation set --- множество сочленения.

Given a hypergraph [math]\displaystyle{ {\mathcal E} = (V, \{E_{1}, \ldots, E_{m}\}) }[/math], a set [math]\displaystyle{ A \subseteq V }[/math] is an articulation set for [math]\displaystyle{ {\mathcal E} }[/math] if [math]\displaystyle{ A = E_{1} \cap E_{2} }[/math] for some pair of hyperedges [math]\displaystyle{ E_{1}, E_{2} \in {\mathcal E} }[/math] and [math]\displaystyle{ {\mathcal E}[V \setminus A] }[/math] has more connected components than [math]\displaystyle{ {\mathcal E} }[/math].