Anti-Ramsey properties of random graphs

详细信息    查看全文

• 作者：Tom Bohman ; Alan Frieze ; Oleg Pikhurko ; Cliff Smyth
• 关键词：Ramsey theory ; Random graphs
• 刊名：Journal of Combinatorial Theory, Series B
• 出版年：2010
• 出版时间：May 2010
• 年：2010
• 卷：100
• 期：3
• 页码：299-312
• 全文大小：230 K

文摘

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