| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657208 | Journal of Combinatorial Theory, Series B | 2010 | 14 Pages |
Abstract
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a different color. A graph has property A(b,H) if every b-bounded coloring of its edges has a rainbow copy of H. We estimate the threshold for the random graph Gn,p to have property A(b,H).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
