next up previous
Next: Clique number of 4-cycle-free Up: More exercises Previous: Rich submatrices

Degree of induced subgraphs


\begin{proof} For a graph $G=(V,E)$, let $d_{\mathrm{ave}}(G)=\frac{1}{\vert V... ...by one, until only vertices of large degree remain.}\end{itemize} \end{proof}

Jukna 2003-01-15