Assertion: clique | /r/HasProperty | log n)2
Facets:
Source sentences:
text: Feige (2004) describes a polynomial time algorithm that finds a clique of size Ω((log n/log log n)2) in any graph that has clique number Ω(n/logkn) for any constant k.