Bisimplicial edge

Bisimplicial edge --- бисимплициальное ребро.

An edge [math]\displaystyle{ e = (x,y) }[/math] of a bipartite graph [math]\displaystyle{ H }[/math] is called a bisimplicial edge if [math]\displaystyle{ N(x) \cup N(y) }[/math] ([math]\displaystyle{ N(x) }[/math] is the neighborhood of [math]\displaystyle{ x }[/math]) induces a complete bipartite subgraph of [math]\displaystyle{ H }[/math].