Rainbow H-factors

Raphael Yuster

doi:10.37236/1039

Rainbow H-factors

Raphael Yuster

Department of Mathematics

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

Abstract

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 language	English
Pages (from-to)	1-8
Number of pages	8
Journal	Electronic Journal of Combinatorics
Volume	13
Issue number	1 R
DOIs	https://doi.org/10.37236/1039
State	Published - 15 Feb 2006

ASJC Scopus subject areas

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

Access to Document

10.37236/1039

Cite this

@article{90cf6ce500ee4e27b988476a9ef6cbfa,

title = "Rainbow H-factors",

abstract = "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.",

author = "Raphael Yuster",

year = "2006",

month = feb,

day = "15",

doi = "10.37236/1039",

language = "English",

volume = "13",

pages = "1--8",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Australian National University",

number = "1 R",

}

TY - JOUR

T1 - Rainbow H-factors

AU - Yuster, Raphael

PY - 2006/2/15

Y1 - 2006/2/15

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33144487644

U2 - 10.37236/1039

DO - 10.37236/1039

M3 - Article

AN - SCOPUS:33144487644

SN - 1077-8926

VL - 13

SP - 1

EP - 8

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1 R

ER -

Rainbow H-factors

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this