A note on spanning <em>K</em>_<em>r</em>-cycles in random graphs

Abstract

We find a threshold for the existence of a collection of edge disjoint copies of Kr that form a cyclic structure and span all vertices of Gn,p. We use a recent result of Riordan to give a two line proof of the main result.

Keywords

• spanning
• <i>k</i>_<i>r</i>-cycle
• threshold