solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看815次
A survey of quantitative bounds for hypergraph Ramsey problems. (arXiv:1707.04229v1 [math.CO])
来源于:arXiv
The classical hypergraph Ramsey number $r_k(s,n)$ is the minimum $N$ such
that for every red-blue coloring of the $k$-tuples of $\{1,\ldots, 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 survey a variety of problems
and results in hypergraph Ramsey theory that have grown out of understanding
the quantitative aspects of $r_k(s,n)$. Our focus is on recent developments. We
also include several new results and proofs that have not been published
elsewhere. 查看全文>>