A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

Suppose that 0<η<10<η<1 is given. We call a graph, GG, on nn vertices an ηη-Chvátal graph if its degree sequence d1≤d2≤⋯≤dnd1≤d2≤⋯≤dn satisfies: for k