Finding Hamilton cycles in random graphs with few queries

We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of g(n,p) in order to typically find a subgraph possessing a given target property. We show that if p≥ 1n n+1n 1n n+ω(1)/1, then one can find a Hamilton cycle with high probability after exposing (1 + 0(1))n edges. Our result is tight in both p and the number of exposed edges.