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

有界度图Ramsey数的一个迁移原理

A transference principle for Ramsey numbers of bounded degree graphs

Choongbum Lee

摘要:

研究了有界度图的Ramsey数,给出了一般有界度图和小带宽有界度图的Ramsey数的一个插值结果.我们的主要定理意味着存在一个常数$c$,使得对于每个$Δ$,存在$β$,使得如果$G$是一个最大度至多为$Δ$的$n$ -顶点图,具有一个同态$f$到一个最大度至多为$d$的图$H$,其中对于所有$v \in V(H)$,$|f^{-1}(v)| \le βn$,则$G$的Ramsey数至多为$c^{d \log d} n$。Graham、Rödl和Ruciński的构造表明,只有当$β\le (c')^Δ$对于某个常数$c' < 1$时,上述陈述才成立。我们进一步研究了参数$β$使用密度型嵌入定理的二部图的小带宽。这个定理可能是独立的利益。

英文摘要:

We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists a constant $c$ such that for every $Δ$, there exists $β$ such that if $G$ is an $n$-vertex graph with maximum degree at most $Δ$ having a homomorphism $f$ into a graph $H$ of maximum degree at most $d$ where $|f^{-1}(v)| \le βn$ for all $v \in V(H)$, then the Ramsey number of $G$ is at most $c^{d \log d} n$. A construction of Graham, Rödl, and Ruciński shows that the statement above holds only if $β\le (c')^Δ$ for some constant $c' < 1$. We further study the parameter $β$ using a density-type embedding theorem for bipartite graphs of small bandwidth. This theorem may be of independent interest.

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

↑