Rainbow \(H\)-factors (Q815207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5006926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rainbow \(H\)-factors |
scientific article; zbMATH DE number 5006926 |
Statements
Rainbow \(H\)-factors (English)
0 references
16 February 2006
0 references
Summary: 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.
0 references
colors
0 references
edge-colored graph
0 references
0.8766937255859375
0 references
0.835787832736969
0 references
0.8217595815658569
0 references
0.8155249357223511
0 references
0.8125134706497192
0 references
