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

可加桥图类中的连通性:McDiarmid-Steger-Welsh猜想

Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

Guillaume Chapuy, Guillem Perarnau

AI总结:

本文证明了McDiarmid-Steger-Welsh猜想:任意可加桥图类中均匀随机图的连通概率至少为$e^{-1/2}+o(1)$,通过局部双计数策略转化为多元优化问题求解。

摘要:

一类图被称为可加桥图类,如果给定该类中的图$G$,通过添加一条连接$G$的两个连通分量的边而得到的任何图也属于该类。我们证明了McDiarmid、Steger和Welsh的一个猜想,该猜想指出:若$\mathcal{G}_n$是任意一个在$n$个顶点上的可加桥图类,且$G_n$从$\mathcal{G}_n$中均匀随机选取,则当$n$趋于无穷时,$G_n$连通的概率至少为$e^{-\frac{1}{2}} + o(1)$。这个下界是渐近最优的,因为森林达到了该下界。我们的证明采用了一种可能具有独立意义的“局部双计数”策略,该策略使我们能够通过求解一个相关的多元优化问题来比较两个组合对象集合的大小。在我们的情形中,该优化问题涉及相对于一个超乘性泛函的树的配分函数。

英文摘要:

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that if $\mathcal{G}_n$ is any bridge-addable class of graphs on $n$ vertices, and $G_n$ is taken uniformly at random from $\mathcal{G}_n$, then $G_n$ is connected with probability at least $e^{-\frac{1}{2}} + o(1)$, when $n$ tends to infinity. This lower bound is asymptotically best possible since it is reached for forests. Our proof uses a "local double counting" strategy that may be of independent interest, and that enables us to compare the size of two sets of combinatorial objects by solving a related multivariate optimization problem. In our case, the optimization problem deals with partition functions of trees relative to a supermultiplicative functional.

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

↑