A tight bound for the clique query problem in two rounds. - Uriel Feige; Tom Ferster (CoRR, 2021)