Pith. sign in

REVIEW 1 cited by

Long paths and Hamiltonicity in random graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1507.00205 v1 pith:TVKEDAVJ submitted 2015-07-01 math.CO math.PR

Michael Krivelevich This is my paper · ORCID
classification math.COmath.PR
keywords graphslongpathsrandomaccessiblealgorithmboostersclassical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Universality for rainbow oriented cycles in perturbed digraphs

    math.CO 2026-05 unverdicted novelty 6.0 of 10

    Randomly perturbed digraphs with n-edge-colorings contain rainbow copies of all oriented cycles of all lengths simultaneously, with high probability.

Pith tools