2000 character limit reached
Sharp thresholds for spanning regular subgraphs
Published 20 Feb 2025 in math.CO | (2502.14794v3)
Abstract: We prove that is the sharp threshold for the appearance of the square of a Hamilton cycle in , confirming the conjecture of Kahn, Narayanan, and Park. We also find the exact asymptotics of the threshold for the emergence of a spanning subgraph isomorphic to a fixed graph for a wide family of -regular graphs . This family includes almost all -regular graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper.