• Title of article

    Covering a graph by complete bipartite graphs

  • Author/Authors

    P. Erdős، نويسنده , , L. Pyber، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1997
  • Pages
    3
  • From page
    249
  • To page
    251
  • Abstract
    We prove the following theorem: the edge set of every graph G on n vertices can be partitioned into the disjoint union of complete bipartite graphs such that each vertex is contained by at most c(n/log n) of the bipartite graphs.
  • Journal title
    Discrete Mathematics
  • Serial Year
    1997
  • Journal title
    Discrete Mathematics
  • Record number

    951517

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=951517