摘要: A clique is a maximal complete subgraph of graph. The maximum number cliques possible in graph withn nodes determined. Also, bounds are obtained for the different sizes such
springer.com
sci-hub.se 参考文章(1)
P. Turán, On the theory of graphs Colloquium Mathematicum. ,vol. 3, pp. 19- 30 ,(1954) , 10.4064/CM-3-1-19-30