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.
This is a preview of subscription content, log in via an institution to check access.
Access this article Subscribe and saveSpringer+ Basic
€34.99 /Month
Price includes VAT (Germany)
Instant access to the full article PDF.
Similar content being viewed by others Explore related subjectsDiscover the latest articles and news from researchers in related subjects, suggested using machine learning.Technion-Israel Institute of Technology, Haifa
P. Erdös
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4