Random Graph Processes with Degree Restrictions
暂无分享，去创建一个
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.
[1] Nicholas C. Wormald,et al. The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.
[2] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[3] Louis V. Quintas,et al. The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs , 1990, Comput. Chem..
[4] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.