arXiv:1905.04744 [math.CO]AbstractReferencesReviewsResources
A note on spanning $K_r$-cycles in random graphs
Published 2019-05-12Version 1
We find a close approximation to the threshold for the existence of a collection of edge disjoint copies of $K_r$ that form a cyclic structure and span all vertices of $G_{n,p}$. We use a recent result of Riordan to give a two line proof of the main re sult.
Comments: 4 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2108.04323 [math.CO] (Published 2021-08-09)
Isomorphisms between random graphs
arXiv:1611.02934 [math.CO] (Published 2016-11-09)
Asymptotic analysis of the cyclic structure of permutations
arXiv:2311.11733 [math.CO] (Published 2023-11-20)
Linearity Property of Unique Colourings in Random Graphs