A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Algorithms and Combinatorics
We study various properties of a random graph R n , drawn uniformly at random from the class A n of all simple graphs on n labelled vertices that satisfy some given property, such as being planar or having tree-width at most k. In particular, we show that if the class A is 'small' and 'addable', then the probability that R n is connected is bounded away from 0 and from 1. As well as connectivity we study the appearances of subgraphs, and thus also vertex degrees and the numbers ofdoi:10.1007/3-540-33700-8_15 fatcat:7ccpxhzf5vczzpzdyg4fa3sgsu