Spanning F-cycles in random graphs

arXiv2106.10023MaRDI QIDQ6370650FDOQ6370650

Authors: Alberto Espuny Díaz, Yury Person 

Publication date: 18 June 2021

Abstract: 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.

This page was built for publication: Spanning $F$-cycles in random graphs

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