Geodesic
Rainbow \(H\)-factors
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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/\chi(H))hn+o(n)$ has a rainbow $H$-factor.
DOI : 10.37236/1039
Classification : 05C70, 05C15, 05C35
Mots-clés : colors, edge-colored graph 
@article{10_37236_1039,
     author = {Raphael Yuster},
     title = {Rainbow {\(H\)-factors}},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1039},
     zbl = {1081.05095},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1039/}
}
TY  - JOUR
AU  - Raphael Yuster
TI  - Rainbow \(H\)-factors
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1039/
DO  - 10.37236/1039
ID  - 10_37236_1039
ER  - 
%0 Journal Article
%A Raphael Yuster
%T Rainbow \(H\)-factors
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1039/
%R 10.37236/1039
%F 10_37236_1039
Raphael Yuster. Rainbow \(H\)-factors. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1039

Cité par Sources :