next up previous
Next: Zero-patterns of polynomials Up: More exercises Previous: Degree of induced subgraphs

Clique number of 4-cycle-free graphs


\begin{proof} A graph is $C_4$-\emph{free} if it contains no cycle of length... ...ow that in both cases, $\omega(G)=\Omega(a^2/n)$. }\end{itemize} \end{proof}

Jukna 2003-01-15