Hamilton Cycles in Random Graphs: a bibliography

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

arxiv 1901.07139 v28 pith:XMSWGZ2Y submitted 2019-01-22 math.CO

Alan Frieze This is my paper · ORCID

classification math.CO

keywords bibliographycyclesgraphshamiltonrandomannotatedhypergraphs

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

A large hole in pseudo-random graphs
math.CO 2025-05 conditional novelty 8.0 of 10

Any (n,d,lambda)-graph with lambda/d small contains an induced cycle of length Omega(n/d), and this is tight up to constants.
Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model
math.PR 2026-07 conditional novelty 7.0 of 10

Approximate stochastic localization plus conductance transfers yield a weak Poincaré inequality for the SK model at β < 1/2, enabling efficient Glauber sampling from a warm start.
Hamilton cycles in regular graphs perturbed by a random 2-factor
math.CO 2025-06 conditional novelty 7.0 of 10

For every integer d ≥ 2, the union of any d-regular graph on n vertices with a uniformly random 2-factor is Hamiltonian with high probability.