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

关于稀疏随机图宽度的一个注记

A note on the width of sparse random graphs

Tuan Anh Do, Joshua Erde, Mihyun Kang

AI总结:

本文用直接证明重证超临界随机图秩宽与树宽结果,避免黑箱引用扩张定理并给出 ε 的显式界,还确定弱超临界区域中宽度的常数因子渐近。

摘要:

在本注记中,我们根据若干常被研究的宽度测度,考察超临界随机图的宽度。对于 p=(1+ε)/n(其中 ε>0 为常数)时随机图 G(n,p) 的秩宽和树宽,我们给出了关于 Lee、Lee 和 Oum,以及 Perarnau 和 Serra 所得结果的简短而直接的证明。我们的证明避免将 Benjamini、Kozma 和 Wormald 关于该区域中巨分量扩张性质的结果作为黑箱使用,因此进一步的益处是,我们得到了这些结果对 ε 依赖关系的显式界。最后,我们还考察了弱超临界区域中随机图的宽度,此时 ε=o(1) 且 ε^3n→∞。在该区域中,我们确定了 G(n,p) 的秩宽和树宽作为 n 与 ε 的函数,精确到一个常数乘法因子。

英文摘要:

In this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank- and tree-width of the random graph $G(n,p)$ when $p= \frac{1+ε}{n}$ for $ε> 0$ constant. Our proofs avoid the use, as a black box, of a result of Benjamini, Kozma and Wormald on the expansion properties of the giant component in this regime, and so as a further benefit we obtain explicit bounds on the dependence of these results on $ε$. Finally, we also consider the width of the random graph in the weakly supercritical regime, where $ε= o(1)$ and $ε^3n \to \infty$. In this regime, we determine, up to a constant multiplicative factor, the rank- and tree-width of $G(n,p)$ as a function of $n$ and $ε$.

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

↑