Biclique edge covering number

Biclique edge covering number --- число бикликового покрытия ребер.

The biclique edge covering number of a bipartire graph [math]\displaystyle{ B }[/math], [math]\displaystyle{ \beta^{\ast}(B) }[/math], is defined as the minimum number of bicliques required to cover the edges of [math]\displaystyle{ B }[/math].