2 problems

Let $L=\{\lambda\}$, where $\lambda$ is a constant, and let $bp_L(K_n)$ denote the minimum number of bicliques in an $L$-biclique covering of the complete graph $K_n$, in which eve…

Let $G$ be a graph and $t$ a positive integer. A $t$-biclique covering is a collection of complete bipartite graphs covering every edge of $G$ at least once and at most $t$ times;…