pith. sign in

arxiv: 1507.00205 · v1 · pith:TVKEDAVJnew · submitted 2015-07-01 · 🧮 math.CO · math.PR

Long paths and Hamiltonicity in random graphs

Michael Krivelevich This is my paper
classification 🧮 math.CO math.PR
keywords graphslongpathsrandomaccessiblealgorithmboostersclassical
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Universality for rainbow oriented cycles in perturbed digraphs

    math.CO 2026-05 unverdicted novelty 6.0

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