Simple versus nonsimple loops on random regular graphs

From MaRDI portal




Abstract: In this note we solve the ``birthday problem for loops on random regular graphs. Namely, for fixed dge3, we prove that on a random d-regular graph with n vertices, as n approaches infinity, with high probability: (i) almost all primitive non-backtracking loops of length kprecsqrtn are simple, i.e. do not self-intersect, (ii) almost all primitive non-backtracking loops of length ksuccsqrtn self-intersect.











This page was built for publication: Simple versus nonsimple loops on random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199381)