Export file:


  • RIS(for EndNote,Reference Manager,ProCite)
  • BibTex
  • Text


  • Citation Only
  • Citation and Abstract

A note on spanning Kr-cycles in random graphs

Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213, USA

Special Issues: New advances in Combinatorics

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.
  Article Metrics
Download full text in PDF

Export Citation

Article outline

Copyright © AIMS Press All Rights Reserved