On cliques in graphs

@article{Moon1965OnCI,
  title={On cliques in graphs},
  author={J. Moon and L. Moser},
  journal={Israel Journal of Mathematics},
  year={1965},
  volume={3},
  pages={23-28}
}
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph. 

Figures from this paper

On cliques in graphs
The number of maximal independent sets in a connected graph
The number of maximal independent sets in connected graphs
  • Z. Füredi
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1987
Maximal independent sets in bipartite graphs
  • Jiuqiang Liu
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1993
The maximum number of maximal independent sets in unicyclic connected graphs
An upper bound on the number of cliques in a graph
The maximum number of cliques in dense graphs
The maximal number of induced complete bipartite graphs
On cliques in graphs
Clique , independent set , and graph coloring
...
1
2
3
4
5
...

References

On the theory of graphs