The Triangle-Free Process and the Ramsey Number $R(3,k)$(Memoirs of the American Mathematical Society)

无三角过程和拉姆齐数

组合数学

售   价:
678.00
发货周期:国外库房发货,通常付款后3-5周到货!
出版时间
2020年04月30日
装      帧
平装
ISBN
9781470440718
复制
页      码
125
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The areas of Ramsey theory and random graphs have been closely linked ever since Erdos’s famous proof in 1947 that the ``diagonal’’ Ramsey numbers $R(k)$ grow exponentially in $k$. In the early 1990s, the triangle-free process was introduced as a model which might potentially provide good lower bounds for the ``off-diagonal’’ Ramsey numbers $R(3,k)$. In this model, edges of $K_n$ are introduced one-by-one at random and added to the graph if they do not create a triangle; the resulting final (random) graph is denoted $G_n,triangle $. In 2009, Bohman succeeded in following this process for a positive fraction of its duration, and thus obtained a second proof of Kim’s celebrated result that $R(3,k) = Theta big ( k^2 / log k big )$. In this paper the authors improve the results of both Bohman and Kim and follow the triangle-free process all the way to its asymptotic end.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个