REVIEW 2 cited by
Sharp thresholds for spanning regular subgraphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We prove that $(1+o(1))\sqrt{e/n}$ is the sharp threshold for the appearance of the square of a Hamilton cycle in $G(n,p)$, 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 $F$ for a wide family of $d$-regular graphs $F$. This family includes almost all $d$-regular graphs.
Forward citations
Cited by 2 Pith papers
-
Universality in random graphs via optimal linking systems: trees and beyond
An absolute constant C suffices for bounded-degree tree universality in G(n, C ln n/n), and cycle-factor universality is optimal up to constants via depth-optimal linking systems.
-
On the threshold for triangulations inside convex polygons
A random set of diagonals of a convex n-gon, each present with probability p, contains a triangulation with high probability whenever p > p* approximately 0.4916.
Discussion (0). Sign in to comment.