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
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 inExpand
The number of maximal independent sets in a connected graph
TLDR
The maximum number of maximal independent sets which a connected graph on n vertices can have is determined, and the extremal graphs are completely characterize, thereby answering a question of Wilf. Expand
The number of maximal independent sets in connected graphs
  • Z. Füredi
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1987
TLDR
A theorem of Moon and Moser is generalized to determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. Expand
Maximal independent sets in bipartite graphs
  • Jiuqiang Liu
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1993
TLDR
The maximum number of maximal independent sets among all bipartite graphs of order n and the extremal graphs as well as the corresponding results for connected bipartites graphs are determined. Expand
The maximum number of maximal independent sets in unicyclic connected graphs
TLDR
The maximum number of maximal independent sets in a unicyclic connected graph is determined and a class of graphs achieving this maximum value is found. Expand
An upper bound on the number of cliques in a graph
TLDR
It is proved that if the complement of a graph G on n vertices contains no set of t + 1 pairwise disjoint edges as an induced subgraph, then G has fewer than (n/2t)2t maximal complete subgraphs. Expand
The maximum number of cliques in dense graphs
TLDR
The density ω ( G ) is the number of vertices in the largest clique of G where G is a maximal complete subgraph and ω(G)⩾ 1 2 |G| , then G has at most 2 cliques. Expand
The maximal number of induced complete bipartite graphs
Abstract The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size.
On cliques in graphs
Sharp bounds are found on the maximal number of sizes of cliques in a graph onn vertices.
Clique , independent set , and graph coloring
This article introduces the closely related maximum clique, maximum independent set, graph coloring, and minimum clique partitioning problems. The survey includes some of the most important resultsExpand
...
1
2
3
4
5
...

References

On the theory of graphs