Abstract
Sharp bounds are found on the maximal number of sizes of cliques in a graph on n vertices.
Original language | English (US) |
---|---|
Pages (from-to) | 419-421 |
Number of pages | 3 |
Journal | Israel Journal of Mathematics |
Volume | 9 |
Issue number | 4 |
DOIs | |
State | Published - Feb 1971 |
ASJC Scopus subject areas
- General Mathematics