Let @r(n) denote the smallest integer with the property that any graph with n vertices can be covered by @r(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing @r(n)=n+o(n^1^1^1^4^+^@e) for any positive @e.
['Fan R. K. Chung']
On the coverings of graphs