Assertion: maximal clique | /r/HasProperty | o(3n⁄ 3
Facets:
value: by a result
type: OTHER
Source sentences:
text: By a result of Moon & Moser (1965), any n-vertex graph has at most 3n⁄ 3 maximal cliques, and the worst-case running time of the Bron–Kerbosch algorithm (with a pivot strategy that minimizes the number of recursive calls made at each step) is O(3n⁄ 3 ), matching this bound.