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 |
Fingerprint
ASJC Scopus subject areas
- Mathematics(all)
Cite this
On cliques in graphs. / Spencer, J. H.
In: Israel Journal of Mathematics, Vol. 9, No. 4, 02.1971, p. 419-421.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On cliques in graphs
AU - Spencer, J. H.
PY - 1971/2
Y1 - 1971/2
N2 - Sharp bounds are found on the maximal number of sizes of cliques in a graph on n vertices.
AB - Sharp bounds are found on the maximal number of sizes of cliques in a graph on n vertices.
UR - http://www.scopus.com/inward/record.url?scp=51249189781&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51249189781&partnerID=8YFLogxK
U2 - 10.1007/BF02771457
DO - 10.1007/BF02771457
M3 - Article
VL - 9
SP - 419
EP - 421
JO - Israel Journal of Mathematics
JF - Israel Journal of Mathematics
SN - 0021-2172
IS - 4
ER -