Hostname: page-component-5db58dd55d-xnzfm Total loading time: 0 Render date: 2026-06-01T14:02:18.276Z Has data issue: false hasContentIssue false
  • English
  • Français

Random Graph Processes with Degree Restrictions

Published online by Cambridge University Press:  12 September 2008

A. Ruciński  and
N. C. Wormald
A. Ruciński
Affiliation:
Department of Discrete Mathematics, Adam Mickiewicz University, Matejki 48–49, 60–769 Poznań, Poland
N. C. Wormald
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, VIC 3052, Australia
Get access Rights & Permissions [Opens in a new window]

Abstract

Suppose that a process begins with n isolated vertices, to which edges are added randomly one by one so that the maximum degree of the induced graph is always bounded above by d. We prove that if n → ∞ with d fixed, then with probability tending to 1, the final result of this process is a graph with ⌊nd / 2⌋ edges.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 1 , Issue 2 , June 1992 , pp. 169 - 180
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Balińska, K. T. and Quintas, L. V. (1990) The sequential generation of random f-graphs. Line maximal 2-, 3-, and 4-graphs, Computers & Chemistry 14 323–328.CrossRefGoogle Scholar
[2]Bollobás, B. (1985) Random graphs, Academic Press, London.Google Scholar
[3]Bollobás, B. (1990) Sharp concentration of measure phenomena in the theory of random graphs, Proc. of Random Gaphs ‘87, Karoński, et al. eds., Wiley.Google Scholar
[4]McDiarmid, C. (1989) On the method of bounded differences, Surveys in Combinatorics 1989 (invited papers of the 12th British Combinatorial Conference), Siemons, J. ed. 148–188.Google Scholar
[5]McKay, B. D. and Wormald, N. C. (1991) Uniform generation of random regular graphs of moderate degree, J. Algorithms 11, 52–67.CrossRefGoogle Scholar
[6]Ruciński, A. (1990) Maximal graphs with bounded maximum degree: Structure, asymptotic enumeration, randomness, Proc. III of the 7th Fischland Colloquium, Rostock Math. Kolloq. 41 47–58.Google Scholar
[7]Ruciński, A. and Wormald, N. C. (in preparation) A nontrivial random 2-regular graph.Google Scholar
[8]Tinhofer, G. (1979) On the generation of random graphs with given properties and known distribution, Appl. Comput. Sci., Ber. Prakt. Inf. 13, 265–297.Google Scholar
[9]Wormald, N. C. (1981) The asymptotic distribution of short cycles in random regular graphs, J. Combin. Theory Ser. B 31 168–182.CrossRefGoogle Scholar