Carnegie Mellon University
Browse

Anti-Ramsey properties of random graphs

Download (209.74 kB)
journal contribution
posted on 2008-09-29, 00:00 authored by Tom Bohman, Alan FriezeAlan Frieze, Oleg Pikhurko, Cliff Smyth

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).

History

Publisher Statement

This is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at http://dx.doi.org/10.1016/j.jctb.2009.09.002

Date

2008-09-29

Usage metrics

    Categories

    Keywords

    Ramsey theoryRandom graphsMathematical Sciences not elsewhere classified

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC