REVIEW 1 cited by
Spread blow-up lemma with an application to perturbed random graphs
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
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a probability measure over copies of a desired spanning graph $H$ in a given system of super-regular pairs which does not heavily pin down any subset of vertices. This allows one to complement the use of the blow-up lemma with the recently resolved Kahn-Kalai conjecture. As an application, we prove an approximate version of a conjecture of B\"ottcher, Parczyk, Sgueglia, and Skokan on the threshold for appearance of powers of Hamilton cycles in perturbed random graphs.
Forward citations
Cited by 1 Pith paper
-
Robustness of the Sauer-Spencer Theorem
A random subgraph of a graph with minimum degree at least (1 - 1/(2Δ))n contains, with high probability, any spanning n-vertex graph of maximum degree Δ, once edges are kept with probability at least C n^{-1/m1(H)} log n.
Discussion (0). Sign in to comment.