The Decomposition Threshold for Bipartite Graphs with Minimum Degree One

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)121-134
Number of pages14
JournalRandom Structures and Algorithms
Volume21
Issue number2
DOIs
StatePublished - Sep 2002

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'The Decomposition Threshold for Bipartite Graphs with Minimum Degree One'. Together they form a unique fingerprint.

Cite this