arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.0461math.CO
收藏

团与超立方体的Ramsey数

The Ramsey number of the clique and the hypercube

Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan

摘要:

Ramsey数r(K_s,Q_n)是使完全图K_N的N个顶点上的边的红-蓝染色包含红色n维超立方体或蓝色团的最小正整数N。对1983年Burr和Erdahs提出的一个问题,改进了Conlon,Fox,Lee和Sudakov以及当前作者的最新结果,我们证明了对任意s \in \N和任意充分大的n \in \N,r(K_s,Q_n)=(s-1)(2^n - 1)+ 1.

英文摘要:

The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dimensional hypercube, or a blue clique on s vertices. Answering a question of Burr and Erdős from 1983, and improving on recent results of Conlon, Fox, Lee and Sudakov, and of the current authors, we show that r(K_s,Q_n) = (s-1) (2^n - 1) + 1 for every s \in \N and every sufficiently large n \in \N.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑