More on the bipartite decomposition of random graphs

Noga Alon, Tom Bohman, Hao Huang

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them.…