Tight Sherali-Adams Lower Bounds for the Average-Case k-Clique Problem on Erdős-Rényi Random Graphs

Sherali-Adams with polynomially bounded coefficients requires size nΩ(D) to refute the existence of an nΘ(1)-clique in Erdős-Rényi random graphs whose maximum clique size is at most D ≤ 2 log n.