New lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers
复制标题
超图拉姆齐数的新下界
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Andrew Suk
中科院分区：
文献类型：
--
作者：
D. Mubayi;Andrew Suk
ramsey编号rk（s，n）是最小值n，因此，对于{1，…，n}的k个tuples的每个红色蓝色颜色或n个整数，使它们之间的每个k次数都是蓝色的。 C是一个绝对正常的常数。
The Ramsey number rk(s,n) is the minimum N such that for every red–blue coloring of the k ‐tuples of {1,…,N} , there are s integers such that every k ‐tuple among them is red, or n integers such that every k ‐tuple among them is blue. We prove the following new lower bounds for 4‐uniform hypergraph Ramsey numbers: r4(5,n)>2nclogn and r4(6,n)>22cn1/5 , where c is an absolute positive constant. This substantially improves the previous best bounds of 2ncloglogn and 2nclogn , respectively. Using previously known upper bounds, our result implies that the growth rate of r4(6,n) is double exponential in a power of n .
ErdÅsâHajnal 超图拉姆齐问题
影响因子：
2.6
作者：
Mubayi, Dhruv;Suk, Andrew
通讯作者：
Suk, Andrew