Hypergraph Ramsey numbers of cliques versus stars
Hypergraph Ramsey numbers of cliques versus stars
复制标题
超图拉姆齐派系与明星的数量
DOI:
10.1002/rsa.21155
复制
发表时间:
2023
影响因子:
1
通讯作者:
Verstraëte, Jacques
中科院分区:
文献类型:
--
作者:
Conlon, David;Fox, Jacob;He, Xiaoyu;Mubayi, Dhruv;Suk, Andrew;Verstraëte, Jacques
Let Km(3)$$ {K}_m^{(3)} $$ denote the complete 3‐uniform hypergraph on m$$ m $$ vertices and Sn(3)$$ {S}_n^{(3)} $$ the 3‐uniform hypergraph on n+1$$ n+1 $$ vertices consisting of all n2$$ \left(\genfrac{}{}{0ex}{}{n}{2}\right) $$ edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow either at most polynomially or at least exponentially, we show that the off‐diagonal Ramsey number r(K4(3),Sn(3))$$ r\left({K}_4^{(3)},{S}_n^{(3)}\right) $$ exhibits an unusual intermediate growth rate, namely, 2clog2n≤r(K4(3),Sn(3))≤2c′n2/3logn,$$ {2}^{c\log^2n}\le r\left({K}_4^{(3)},{S}_n^{(3)}\right)\le {2}^{c^{\prime }{n}^{2/3}\log n}, $$for some positive constants c$$ c $$ and c′$$ {c}^{\prime } $$. The proof of these bounds brings in a novel Ramsey problem on grid graphs which may be of independent interest: what is the minimum N$$ N $$ such that any 2‐edge‐coloring of the Cartesian product KN□KN$$ {K}_N\square {K}_N $$ contains either a red rectangle or a blue Kn$$ {K}_n $$?
登录
查看更多内容
DOI:
10.1007/978-0-8176-8092-3
发表时间:
2021-06
期刊:
Complexity of Infinite-Domain Constraint Satisfaction
影响因子:
--
作者:
Lane Barton
通讯作者:
Lane Barton
影响因子:
1.8
作者:
Mubayi, Dhruv;Razborov, Alexander
通讯作者:
Razborov, Alexander
DOI:
--
发表时间:
2014
期刊:
影响因子:
--
作者:
D. Conlon;J. Fox;Choongbum Lee;B. Sudakov
通讯作者:
B. Sudakov
影响因子:
1.1
作者:
D. Conlon;J. Fox;B. Sudakov
通讯作者:
B. Sudakov
DOI:
--
发表时间:
2017
期刊:
影响因子:
--
作者:
D. Mubayi;Andrew Suk
通讯作者:
Andrew Suk