The asymptotic distribution of short cycles in random regular graphs
暂无分享,去创建一个
The probability that a random labelled r -regular graph contains a given number of cycles of given length is investigated asymptotically. Cycles of a finite number of different fixed lengths can be handled simultaneously. For i ≠ j , the probabilities of an i -cycle and a j -cycle occurring are asymptotically independent. The results are actually derived in the more general setting of graphs which have any given degree sequence, as long as the maximum degree is bounded above by a constant. As a special case, an asymptotic formula results for the number of labelled r -regular graphs with a given girth.
[1] N. Wormald. Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.
[2] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[3] Nicholas C. Wormald. Triangles in labelled cubic graphs , 1978 .