P
Initializing...
§2.1, p. 7 (cites [45]) — any k-vertex graph has at most 3^{k/3} maximal cliques · Prove2Me