Searching for a Biclique

A *complete bipartite graph* or *biclique* is a special kind of bipartite graph. If we denote the two partitions of vertices of this graph by $A$ and $B$, then such a biclique is denoted by $K_{|A|, |B|}$ and satisfies the following conditions: - For each pair of vertices $a, b$ ($a \in A$, $b \in B$), there is an edge between vertices $a$ and $b$. - For each pair of vertices $u, v \in A$, there