Finding cliques using few probes. (arXiv:1809.06950v1 [math.CO])

Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\frac{1}{2}}$ (and hence is likely to have a clique of size roughly $2\log n$), then for every $\delta < 2$ and constant $\ell$, there is an $\alpha < 2$ (that may depend on $\delta$ and $\ell$) such that no algorithm that makes $n^{\delta}$ probes in $\ell$ rounds is likely (over the choice of the random graph) to output a clique of size larger than $\alpha \log n$.

from cs updates on arXiv.org https://ift.tt/2MNQ4Gh
//