arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.14006math.CO
收藏

随机图的幂次着色

Coloring powers of random graphs

Carnegie Mellon University(卡内基梅隆大学);Korteweg–de Vries Institute for Mathematics, University of Amsterdam(阿姆斯特丹大学柯帝克-德弗里斯数学研究所);CWI, Amsterdam(荷兰数学与计算机科学研究中心)

Alan Frieze, Ross Kang, Aditya Raut, Michelle Sweering, Hilde Verbeek

AI总结:

研究随机图G_{n,p}的r次幂的最大学生度和色数,给出概率极限界,尤其在稀疏和稠密情况下分别得出不同结论。

摘要:

给定一个图G和整数r≥1,G的r次幂G^r是通过在所有距离不超过r的顶点对之间添加边得到的图。我们关注二项随机图G_{n,p}的r次幂的两个基本结构性质,即最大度Δ(G_{n,p}^r)和色数χ(G_{n,p}^r),并给出概率极限界。在稀疏情况下,即p=d/n(d为固定常数),我们证明Δ(G_{n,p}^r) ~ log n / log_{(r+1)}n(其中log_{(1)}n=log n,log_{(r+1)}n=log log_{(r)}n),且Δ(G_{n,p}^{⌊r/2⌋})+1 ≤ χ(G_{n,p}^r) ≤ Δ(G_{n,p}^{r-1})+1。对于r=2,上界成立时等于下界。在更密集的情况下,当d满足d=ω(log n)且d≤n^{1/r-Ω(1)}时,χ(G_{n,p}^r)=Θ(d^r/log d)概率极限界。

英文摘要:

Given a graph $G$ and an integer $r\ge 1$, the $r$th power $G^r$ of $G$ is the graph obtained from $G$ by adding edges for all pairs of distinct vertices at distance at most $r$ from each other. We focus on two basic structural properties of the $r$th power of the binomial random graph $G_{n,p}$, namely, the maximum degree $Δ(G_{n,p}^r)$ and the chromatic number $χ(G_{n,p}^r)$, and give with high probability (w.h.p.) bounds. In the sparse case that $p=d/n$ for some fixed constant $d>0$, we prove the following. We prove that w.h.p.~$Δ(G_{n,p}^r) \sim \frac{\log n}{\log_{(r+1)}n}$ (where $\log_{(1)}n=\log n$ and $\log_{(r+1)}n=\log\log_{(r)}n$) and that w.h.p.~$Δ(G_{n,p}^{\lfloor{r/2}\rfloor})+1 \le χ(G_{n,p}^r) \le Δ(G_{n,p}^{r-1})+1$. For $r=2$, we show the upper bound holds with equality. For denser cases, for $d$ satisfying $d=ω(\log n)$ and $d\le n^{1/r-Ω(1)}$ as $n\to\infty$, we have $χ(G_{n,p}^r) = Θ(d^r/\log d)$ w.h.p.

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

↑