The decomposition threshold for bipartite graphs with minimum degree one

Authors:
Raphael Yuster
Affiliations:
Department of Mathematics, University of Haifa--Oranim, Tivon 36006 Israel
Venue:
Random Structures & Algorithms
Year:
2002

Citing 4
Cited 2

Graph decomposition is NPC - a complete proof of Holyer's conjecture

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Tree decomposition of graphs

Random Structures & Algorithms
Covering graphs: the covering problem solved

Journal of Combinatorial Theory Series A
Decomposing large graphs with small graphs of high density

Journal of Graph Theory

Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions

Journal of Combinatorial Theory Series B
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let H be a fixed bipartite graph with δ(H) = 1. It is shown that if G is any graph with n vertices and minimum degree at least n/2(1 + on(1)) and e(H) divides e(G), then G can be decomposed into e(G)/e(H) edge-disjoint copies of H. This is best possible and significantly extends the result of an earlier paper by the author [8] which deals with the case where H is a tree.