Skip to main content

Bipartite Coverings of Graphs

  • VOJTECH RÖDL (a1) and ANDRZEJ RUCIŃSKI (a1) (a2)
    • Published online: 01 September 1997

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 nc 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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed