On the subgraph query problem

Ryan Alweiss, Chady Ben Hamida, Xiaoyu He +1

Given a fixed graph $H$, a real number $p\in (0,1)$, and an infinite Erdős-Rényi graph $G\sim G(\infty ,p)$, how many adjacency queries do we have to make to find a copy of $H$ insid…