A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, $bc^*(G)$, and the fractional biclique partition number, $bp^*(G)$, of a graph $G$. It is observed that $bc^*(G)$ and $bp^*(G)$ provide lower bounds on the biclique cover and partition numbers respectively, and conditions for equality are given. It is also shown that $bc^*(G)$ is a better lower bound on the Boolean rank of a binary matrix than the maximum number of isolated onesdoi:10.37236/1100 fatcat:4edzt2pcq5ekhe42zzupndtafy