Rainbow H-factors

Research output: Contribution to journalArticlepeer-review


An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgraph of G whose edges have distinct colors. A rainbow H-factor is an H-factor whose components are rainbow H-subgraphs. The following result is proved. If H is any fixed graph with h vertices then every properly edge-colored graph with hn vertices and minimum degree (1 - 1/χ(H))hn + o(n) has a rainbow H-factor.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalElectronic Journal of Combinatorics
Issue number1 R
StatePublished - 15 Feb 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Rainbow H-factors'. Together they form a unique fingerprint.

Cite this