共 50 条
Anti-Ramsey properties of random graphs
被引:4
|作者:
Bohman, Tom
[1
]
Frieze, Alan
[1
]
Pikhurko, Oleg
[1
]
Smyth, Cliff
[2
]
机构:
[1] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA
[2] MIT, Dept Math, Cambridge, MA 02139 USA
关键词:
Ramsey theory;
Random graphs;
D O I:
10.1016/j.jctb.2009.09.002
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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). (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:299 / 312
页数:14
相关论文