Skip to main content
Springer Nature Link
Log in

Connectivity threshold for random chordal graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

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(n 2) edges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bender, E.A., Richmond, L.B., Wormald, N.C.: Almost all chordal graphs split. J. Aust. Math. Soc., Ser. A38, 214–221 (1985)

    Google Scholar 

  2. Erdös, P., Rényi, A.: On random graphs I. Publ. Math.6, 290–297 (1959)

    Google Scholar 

  3. Erdös, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl.5, 17–61 (1960)

    Google Scholar 

  4. Gavril, F.: The intersection graphs of subtrees of a tree are exactly the chordal graphs. J. Comb. Theory, Ser.B16, 47–56 (1974)

    Google Scholar 

  5. Scheinerman, E.R.: An evolution of interval graphs. Discrete Math.82, 287–302 (1990).

    Google Scholar 

  6. Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J. Graph Theory2, 265–267 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Louisville, 40292, Louisville, KY, USA

    F. R. McMorris

  2. Department of Mathematical Sciences, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Edward R. Scheinerman

Authors
  1. F. R. McMorris
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Edward R. Scheinerman
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Research supported in part by the Office of Naval Research, contract number N00014-85-K0622.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McMorris, F.R., Scheinerman, E.R. Connectivity threshold for random chordal graphs. Graphs and Combinatorics 7, 177–181 (1991). https://doi.org/10.1007/BF01788142

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788142

Keywords