Skip to main content
×
×
Home

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

  • DUDLEY STARK (a1) and NICK WORMALD (a2)
Abstract

We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph G0 in the common random graph models ${\cal G}$ (n,m) and ${\cal G}$ (n,p). Our results apply when the average degrees of the random graphs are below the threshold at which each edge is included in a copy of G0. This extends an argument given earlier by the second author for G0=K3 with a more restricted range of average degree. For all strictly balanced subgraphs G0, our results give much information on the distribution of the number of copies of G0 that are not in large ‘clusters’ of copies. The probability that a random graph in ${\cal G}$ (n,p) has no copies of G0 is shown to be given asymptotically by the exponential of a power series in n and p, over a fairly wide range of p. A corresponding result is also given for ${\cal G}$ (n,m), which gives an asymptotic formula for the number of graphs with n vertices, m edges and no copies of G0, for the applicable range of m. An example is given, computing the asymptotic probability that a random graph has no triangles for p=o(n−7/11) in ${\cal G}$ (n,p) and for m=o(n15/11) in ${\cal G}$ (n,m), extending results of the second author.

Copyright
References
Hide All
[1] Bollobás, B. (1981) Random graphs. In Combinatorics: Proceedings (Swansea, 1981), Vol. 52 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 80102.
[2] Erdős, P., Kleitman, D. J. and Rothschild, B. L. (1976) Asymptotic enumeration of K n-free graphs. In Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, Vol. 17 of Atti dei Convegni Lincei, Accad. Naz. Lincei, pp. 1927.
[3] Frieze, A. (1992) On small subgraphs of random graphs. In Random Graphs (Frieze, A. and Łuczak, T., eds), Vol. 2, Wiley, pp. 6790.
[4] Janson, S., Łuczak, T. and Ruciński, A. (1990) An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In Random Graphs '87 (Karoński, M., Jaworski, J. and Ruciński, A., eds), Wiley, pp. 7387.
[5] Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley.
[6] Łuczak, T. (2000) On triangle-free random graphs. Random Struct. Alg. 16 260276.
[7] Osthus, D., Prömel, H. J. and Taraz, A. (2003) For which densities are random triangle-free graphs almost surely bipartite? Combinatorica 23 105150.
[8] Prömel, H. J. and Steger, A. (1996) Counting H-free graphs. Discrete Math. 154 311315.
[9] Prömel, H. J. and Steger, A. (1996) On the asymptotic structure of sparse triangle free graphs. J. Graph Theory 21 137151.
[10] Ruciński, A. (1988) When are small subgraphs of a random graph normally distributed? Probab. Theory Rel. Fields 78 110.
[11] Wormald, N. C. (1996) The perturbation method and triangle-free random graphs. Random Struct. Alg. 9 253270.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 16 *
Loading metrics...

Abstract views

Total abstract views: 61 *
Loading metrics...

* Views captured on Cambridge Core between 9th May 2018 - 25th June 2018. This data will be updated every 24 hours.