Local and Global Clique Numbers
β
N. Linial; Y. Rabinovich
π
Article
π
1994
π
Elsevier Science
π
English
β 416 KB
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\). 1994 Academic Press, Inc.