A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring(Memoirs of the American Mathematical Society)

任意三边着色单色三角形图形的明显阈值

组合数学

原   价:
626.00
售   价:
501.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出版时间
2005年12月30日
装      帧
平装
ISBN
9780821838259
复制
页      码
66
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Let (mathcal{R}) be the set of all finite graphs (G) with the Ramsey property that every coloring of the edges of (G) by two colors yields a monochromatic triangle. In this paper we establish a sharp threshold for random graphs with this property. Let (G(n,p)) be the random graph on (n) vertices with edge probability (p). We prove that there exists a function (widehat c=widehat c(n)=Theta(1)) such that for any (varepsilon > 0), as (n) tends to infinity, (Prleft[[]G(n,(1-varepsilon)widehat c/sqrt{n}) in mathcal{R} right] rightarrow 0) and (Pr left[[] G(n,(1+varepsilon)widehat c/sqrt{n}) in mathcal{R} right] rightarrow 1). A crucial tool that is used in the proof and is of independent interest is a generalization of Szemerédi’s Regularity Lemma to a certain hypergraph setting.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个