Abstract
Consider a graph G with the property that any set of p vertices in G contains a q-clique. Fairly tight lower bounds are proved on the clique number of G as a function of p, q and the number of vertices in G.
| Original language | English |
|---|---|
| Pages (from-to) | 5-15 |
| Number of pages | 11 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 61 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 1994 |