Search papers, labs, and topics across Lattice.
University of Oxford
1
0
Mild pseudorandomness is sufficient for Hamiltonicity, guaranteeing full cycle covers in regular graphs with only a weak spectral gap and polylogarithmic degree.