sudakov-robust-dirac-graph

First, we consider a random subgraph of a Dirac graph obtained by taking
each edge independently with probability p, and prove that there exists a constant C such that if p ≥ C log n/n, then
a.a.s. the resulting random subgraph is still Hamiltonian.

classification result

Comments