%0 Journal Article
%T Decomposition of random graphs into complete bipartite graphs
%A Fan Chung
%A Xing Peng
%J Mathematics
%D 2014
%I arXiv
%X We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $\tau(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $\tau(G)$ is between $n- c(\ln_{1/p} n)^{3+\epsilon}$ and $n - 2\ln_{1/(1-p)} n$ for any positive constants $c$ and $\epsilon$.
%U http://arxiv.org/abs/1402.0860v3