\documentclass[12pt]{article}
\usepackage{fullpage}
\usepackage{epsfig}
\usepackage{latexsym}
\begin{document}
\begin{center}
\bf
Algorithms\\
Computer Science 140 \& Mathematics 168\\
Instructor: B. Thom\\
Spring 2004\\
\rm
Homework 11a\\
Due on 4/8/04 (beginning of class)\\
\end{center}
\begin{enumerate}
\item \textbf{[20 Points] Review of Network Flow Proofs.}

In class, we proved four fundamental theorems which, in the end, will
allow us to show that the network flow algorithms that we will soon
discuss do indeed find maximum flows from $s$ to $t$.  For this
assignment, you will re-prove the theorems seen in class today:

\begin{enumerate}
\item The Cut Theorem
\item The Capacity Theorem
\item The Max-Flow Min-Cut Theorem
\item The Greed is Good Theorem.
\end{enumerate}

Note that our proofs and approach are easier than those given in the
book.  Your task is to carefully write out the proofs for the
these theorems {\bf as presented in class.}  Your grade will
be based largely on how clearly and precisely you write your proofs.









\end{enumerate}
\end{document}
