More on the Bipartite Decomposition of Random Graphs

@article{Alon2017MoreOT,
  title={More on the Bipartite Decomposition of Random Graphs},
  author={Noga Alon and Tom Bohman and Hao Huang},
  journal={Journal of Graph Theory},
  year={2017},
  volume={84},
  pages={45-52}
}
For a graph G = (V,E), let bp(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. It is easy to see that for every graph G, bp(G) ≤ n − α(G), where α(G) is the maximum size of an independent set of G. Erdős conjectured in the 80s that for almost every graph G… CONTINUE READING