Incidence graph

Incidence graph --- граф инцидентности.

The (bipartite vertex-edge) [math]\displaystyle{ {\mathcal IG(H)} = (V, {\mathcal H}, E) }[/math] of the ypergraph [math]\displaystyle{ {\mathcal H} }[/math] is a bipartite graph with a vertex set [math]\displaystyle{ V \cup {\mathcal H} }[/math], where two vertices [math]\displaystyle{ v \in V }[/math] and [math]\displaystyle{ e \in {\mathcal H} }[/math] are adjacent if and only if [math]\displaystyle{ v \in e }[/math].