The Decomposition Threshold for Bipartite Graphs with Minimum Degree One

Raphael Yuster

doi:10.1002/rsa.10044

The Decomposition Threshold for Bipartite Graphs with Minimum Degree One

Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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 + o _n(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.

Original language	English
Pages (from-to)	121-134
Number of pages	14
Journal	Random Structures and Algorithms
Volume	21
Issue number	2
DOIs	https://doi.org/10.1002/rsa.10044
State	Published - Sep 2002

ASJC Scopus subject areas

Software
General Mathematics
Computer Graphics and Computer-Aided Design
Applied Mathematics

Access to Document

10.1002/rsa.10044

Cite this

@article{c2e9a69b5483427c97e10a916d8f57f9,

title = "The Decomposition Threshold for Bipartite Graphs with Minimum Degree One",

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 + o n(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.",

author = "Raphael Yuster",

year = "2002",

month = sep,

doi = "10.1002/rsa.10044",

language = "English",

volume = "21",

pages = "121--134",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - The Decomposition Threshold for Bipartite Graphs with Minimum Degree One

AU - Yuster, Raphael

PY - 2002/9

Y1 - 2002/9

N2 - 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 + o n(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.

AB - 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 + o n(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.

UR - http://www.scopus.com/inward/record.url?scp=0036370058&partnerID=8YFLogxK

U2 - 10.1002/rsa.10044

DO - 10.1002/rsa.10044

M3 - Article

AN - SCOPUS:0036370058

SN - 1042-9832

VL - 21

SP - 121

EP - 134

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

The Decomposition Threshold for Bipartite Graphs with Minimum Degree One

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this