The Library
Anti-Ramsey properties of random graphs
Tools
Tools
Tools
Bohman, Tom, Frieze, Alan, Pikhurko, Oleg and Smyth, Cliff (2010) Anti-Ramsey properties of random graphs. Journal of Combinatorial Theory, Series B, Vol.100 (No.3). pp. 299-312. doi:10.1016/j.jctb.2009.09.002
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.jctb.2009.09.002
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).
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Journal of Combinatorial Theory, Series B | ||||
| Publisher: | Academic Press | ||||
| ISSN: | 0095-8956 | ||||
| Official Date: | May 2010 | ||||
| Dates: |
|
||||
| Volume: | Vol.100 | ||||
| Number: | No.3 | ||||
| Page Range: | pp. 299-312 | ||||
| DOI: | 10.1016/j.jctb.2009.09.002 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
