Connectivity threshold for random chordal graphs

We introduce a model for random chordal graphs. We determine the thresholds for: the first edge, completeness, isolated vertices and connectivity. Like the Erdös-Rényi model, the thresholds for isolated vertices and connectivity are the same. Unlike the Erdös-Rényi model in which the threshold occurs at 1/2n logn edges, this threshold occurs atO(n2) edges.

[1]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[2]  Edward R. Scheinerman,et al.  An evolution of interval graphs , 1990, Discret. Math..

[3]  Edward A. Bender,et al.  Almost all chordal graphs split , 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[4]  James R. Walter,et al.  Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.

[5]  B. Bollobás.  The evolution of random graphs , 1984 .