On cliques in graphs

@article{Erds1966OnCI,
  title={On cliques in graphs},
  author={P. Erd{\"o}s},
  journal={Israel Journal of Mathematics},
  year={1966},
  volume={4},
  pages={233-234}
}
  • P. Erdös
  • Published 1966
  • Mathematics
  • Israel Journal of Mathematics
A clique is a maximal complete subgraph of a graph. Moon and Moser obtained bounds for the maximum possible number of cliques of different sizes in a graph ofn vertices. These bounds are improved in this note. 
On cliques in graphs
Badly-covered graphs
On the Maximum Number of Cliques in a Graph
  • D. Wood
  • Mathematics, Computer Science
  • Graphs Comb.
  • 2007
Cycle spectra of graphs
Stable fixed points of combinatorial threshold-linear networks.
Statistical Inference on Random Graphs
J an 2 01 8 Finite Asymptotic Clusters of Metric Spaces
Computer-assisted sequencing, interval graphs, and molecular evolution.
Finite asymptotic clusters of metric spaces
...
1
2
...

References

On cliques in graphs