Decomposition of random graphs into complete bipartite graphs Fan Chung

@inproceedings{Peng2014DecompositionOR,
  title={Decomposition of random graphs into complete bipartite graphs Fan Chung},
  author={Xing Peng},
  year={2014}
}
We consider the problem of partitioning the edge set of a graph G into the minimum number τ (G) of edge-disjoint complete bipartite subgraphs. We show that for a random graph G in G(n, p), for 1/2 ≥ p = Ω(1), almost surely τ (G) is between n− c1(log n) 3+ǫ and n− c2 log n for any positive constant ǫ and some positive constants ci.