Skip navigation
Skip navigation

Short cycles in random regular graphs

McKay, Brendan; Wormald, Nicholas C; Wysocka, Beata


Consider random regular graphs of order n and degree d = d(n) ≥ 3. Let g = g(n) ≥ 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution similar to that of independent Poisson variables. In particular, we find the

CollectionsANU Research Publications
Date published: 2004
Type: Journal article
Source: Journal of Combinatorics


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator