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.
|Number of pages||11|
|Journal||Journal of Combinatorial Theory. Series B|
|State||Published - May 1994|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics