arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1708.01211math.CO
收藏

随机正则图和$k$ -out图的Ramsey性质

A Ramsey Property of Random Regular and $k$-out Graphs

Michael Anastos, Deepak Bal

摘要:

本文考虑随机$d$ -正则图$\mathcal{G}(n,d)$的一个Ramsey性质.设$r\ge 2$为固定值。然后,可以对$\mathcal{G}(n, 2r)$的边缘进行着色,使得每个单色分量具有尺寸$o(n)$。另一方面,存在常数$γ> 0$,使得w. h. p.,每个$r$ -$\mathcal{G}(n, 2r+1)$边的着色必须包含长度至少为$γn$的单色循环。对于随机$k$ -out图,我们证明了一个类似的结果.

英文摘要:

In this note we consider a Ramsey property of random $d$-regular graphs, $\mathcal{G}(n,d)$. Let $r\ge 2$ be fixed. Then w.h.p. the edges of $\mathcal{G}(n, 2r)$ can be colored such that every monochromatic component has size $o(n)$. On the other hand, there exists a constant $γ> 0$ such that w.h.p., every $r$-coloring of the edges of $\mathcal{G}(n, 2r+1)$ must contain a monochromatic cycle of length at least $γn$. We prove an analogous result for random $k$-out graphs.

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

↑