论文标题
无标记的桥接图类的连接性
Connectivity for an unlabelled bridge-addable graph class
论文作者
论文摘要
让图A类可桥接；也就是说，每当a中的图形g中的顶点u和v中的不同组件中的图形g时，图形g+uv在A中。对于从a on vertex seet {1，..，n}的随机图均匀地采样的随机图，就会在被连接的概率上已知（例如，概率始终是1/e）。当从A中的未标记的N-Vertex图中统一采样随机图时，我们在这里询问类似的结果。
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.
