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

classification math.CO

keywords bibliographycyclesgraphshamiltonrandomannotatedhypergraphs

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

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.

Weak Poincar\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model
math.PR 2026-07 conditional novelty 7.0

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.
Dirac subgraphs of powers of cycles are Hamiltonian
math.CO 2026-06 unverdicted novelty 7.0

Proves an asymptotic version of the conjecture that Dirac subgraphs of cycle powers are Hamiltonian.
Robust Hamiltonicity in families of Dirac graphs
math.CO 2023-09 unverdicted novelty 7.0

The paper finds the threshold probability for random subgraphs of Dirac graphs to admit Hamilton cycle transversals and derives optimal counting and packing corollaries that generalize single-graph Hamilton cycle results.