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

一类无标号桥可加图类的连通性

Connectivity for an unlabelled bridge-addable graph class

Colin McDiarmid

摘要:

设图类A是桥可加的,即,只要A中的图G的顶点u和v在不同的分支中,则图G+uv在A中。对于从A中顶点集{1,.,n},则存在关于被连接的概率的已知下界(例如,概率总是至少为1/e)。当随机图是从A中的无标号n-顶点图中均匀抽样时,我们在这里询问类似的结果。

英文摘要:

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there are known lower bounds on the probability of being connected (for example, the probability is always at least 1/e). We ask here about similar results when the random graph is sampled uniformly from the unlabelled n-vertex graphs in A.

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

↑