Is there some known relationship between the connectivity $\kappa(G)$ and the clique number $\omega(G)$ of a graph? Just out of curiosity.
In particular, is $\omega(G)$ bounded by some function of $\kappa(G)$? For instance, $\omega(G) \geq f(\kappa(G))$ for some $f$.
If not, as I believe, is there some known construction of graphs with fixed clique number $\omega$ but arbitrarily high connectivity?