P
Initializing...
Theorem 2.1 — a c-closed graph on n vertices has at most 3^{(c−1)/3} n² maximal cliques · Prove2Me