Almost balanced ordered biclique covering of graphs

Anand Babu, Ervin Ranjan, Maddipati Deshith Sai +3

Let $f(n,k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_n$ is covered by at least one and at most $k$ bicliques in the colle…