P

Initializing...

Theorem 3.1, p. 8 — a c-closed graph on n vertices has at most 4^{(c+4)(c−1)/2} n^{2−2^{1−c}} maximal cliques · Prove2Me