next up previous
Next: The permanent lemma Up: More exercises Previous: Combinatorial Nullstellensatz

Regular subgraphs


\begin{proof} A graph is $p$-\emph{regular} if all its vertices have degree ... ... and show that this subgraph must be $p$-regular. }\end{itemize} \end{proof}

Jukna 2003-01-15