\documentstyle[12pt,twoside]{article}

\addtolength{\topmargin}{-1in}
\setlength{\textwidth}{6.5in}
\setlength{\textheight}{9in}

\raggedbottom

\input{macros-course}

\iffalse
\setlength{\topmargin}{-0.50in}
\setlength{\textheight}{8.5in}
\setlength{\oddsidemargin}{0.0in}
\setlength{\evensidemargin}{-0.0in}
\setlength{\textwidth}{6.5in}
\addtolength{\parskip}{2pt}
\addtolength{\itemsep}{0.1in}
\newtheorem{theorem}{Theorem}
\newtheorem{definition}{Definition}
\newtheorem{claim}{Claim}
\newtheorem{lemma}{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\newcommand{\qed}{\mbox{\ \ \ }\rule{6pt}{7pt} \bigskip}
\fi
%\newtheorem{fact}{Fact}
\begin{document}

\handout{teamprobs3}{Problems for Recitation 3}{September 25, 1998}

\begin{enumerate}

\item Prove that a graph is bipartite iff it does not contain an odd
cycle.

\item An {\em Euler cycle} of a graph is a cycle that contains every
edge in the graph exactly once.  Prove that a connected graph has an
Euler cycle iff every vertex has even degree.

\end{enumerate}

\end{document}

