The bipartite dimension of a graph , also called its biclique
cover number, is the smallest number of complete
bipartite subgraphs whose union contains every graph
edge of
. Equivalently, it is the minimum size of an edge
cover of
by complete bipartite subgraphs (Fishburn and Hammer 1996).
The bipartite dimension is at most the edge count of , since each edge is a copy of
.