Showing papers on "K-tree published in 1966"
[...]
TL;DR: Moon and Moser as discussed by the authors obtained bounds for the maximum possible number of cliques of different sizes in a graph of n vertices, and these bounds were improved in this note.
Abstract: 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.
12 citations