Name
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 G"n","p to have property A(b,H). |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jctb.2009.09.002 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
random graph,anti-ramsey property,b time,rainbow copy,graph g,different color,random graphs,b-bounded coloring,ramsey theory | Edge coloring,Complete coloring,Discrete mathematics,Combinatorics,Graph power,Fractional coloring,List coloring,Graph minor,Mathematics,Complement graph,Graph coloring | Journal |
Volume | Issue | ISSN |
100 | 3 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
3 | 0.42 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |
| Alan M. Frieze | 2 | 4837 | 787.00 |
| Oleg Pikhurko | 3 | 318 | 47.03 |
| Cliff Smyth | 4 | 64 | 4.92 |