Article contents
Bipartite Coverings of Graphs
Published online by Cambridge University Press: 01 September 1997
Abstract
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
- Type
- Research Article
- Information
- Copyright
- 1997 Cambridge University Press
- 4
- Cited by