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

桥可变图类的连通性

Connectivity for bridge-alterable graph classes

Colin McDiarmid

摘要:

一个图的集合称为桥可变的,如果对于每个有桥e的图G,G在类中当且仅当G-e是。例如,森林的类是桥可变的。对于从顶点集{1,.,n},Renyi(1959)的经典结果表明$F_n$连通的概率为$e^{-1/2 +o(1)}$ .最近Addario-Berry,McDiarmid和Reed(2012)以及Kang和Panagiotou(2013)独立证明了,给定一个桥可变类,对于从{1,...,n},则$R_n$被连接的概率至少为$e^{-1/2 +o(1)}$。在这里,我们给出了一个更直接的证明,并获得了这个结果的一个更强的非渐近形式,它比较了随机森林的概率。我们看到$R_n$连通的概率至少是$F_t$连通的概率在$\frac25 n < t \leq n$上的最小值。

英文摘要:

A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set of forests on vertex set {1,..,n}, a classical result of Renyi (1959) shows that the probability that $F_n$ is connected is $e^{-1/2 +o(1)}$. Recently Addario-Berry, McDiarmid and Reed (2012) and Kang and Panagiotou (2013) independently proved that, given a bridge-alterable class, for a random graph $R_n$ sampled uniformly from the graphs in the class on {1,..,n}, the probability that $R_n$ is connected is at least $e^{-1/2 +o(1)}$. Here we give a more straightforward proof, and obtain a stronger non-asymptotic form of this result, which compares the probability to that for a random forest. We see that the probability that $R_n$ is connected is at least the minimum over $\frac25 n < t \leq n$ of the probability that $F_t$ is connected.

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

↑