arXiv Analytics

Sign in

arXiv:2106.10023 [math.CO]AbstractReferencesReviewsResources

Spanning $F$-cycles in random graphs

Alberto Espuny Díaz, Yury Person

Published 2021-06-18Version 1

We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we give a sufficient condition under which we may determine its threshold. As an application, we find the threshold for a set of cyclically ordered copies of $C_4$ that span the entire vertex set, so that any two consecutive copies overlap in exactly one edge and all overlapping edges are disjoint. This answers a question of Frieze. We also determine the threshold for edge-overlapping spanning $K_r$-cycles.

Related articles: Most relevant | Search more
arXiv:1810.12433 [math.CO] (Published 2018-10-29)
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
arXiv:2401.12839 [math.CO] (Published 2024-01-23)
Hamilton cycles for involutions of classical types
arXiv:2305.17360 [math.CO] (Published 2023-05-27)
On powers of Hamilton cycles in Ramsey-Turán Theory