Assertion: clique's size | /r/HasProperty | logarithmic
Facets:
Source sentences:
text: Because the maximum clique in a random graph has logarithmic size with high probability, it can be found by a brute force search in expected time 2O(log2n).