论文信息 - Covering a graph by complete bipartite graphs

Covering a graph by complete bipartite graphs

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.

Paul Erdös | László Pyber

[1] Ronald L. Graham,et al. On the addressing problem for loop switching , 1971 .

[2] Alfredo De Santis,et al. On the Information Rate of Secret Sharing Schemes , 1996, Theor. Comput. Sci..

[3] Genghua Fan. Circuit Coverings of Graphs and a Conjecture of Pyber , 1995, J. Comb. Theory, Ser. B.

[4] J. Spencer,et al. On the decomposition of graphs into complete bipartite subgraphs , 1983 .

[5] Zsolt Tuza,et al. Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices , 1984, Comb..

[6] P. Erdos,et al. Studies in Pure Mathematics , 1983 .