\documentclass[12pt]{article}
\usepackage{fullpage,amsmath,amsfonts,graphicx,url}

\begin{document}

\title{General Mathematics and CPS II}
\author{Exercise 4}
\date{February 13, 2015}
\maketitle

\begin{enumerate}

\item Write out the proof for Ivanov, p.\ 96, Lemma 5.

\item A standard deck of cards is dealt into 13 piles of 4 cards each.
Show that you can always choose exactly one card from each of the 13
piles as to obtain exactly one card of each rank, i.e., each of 2, 3,
4, \ldots, King, Ace.

\item Show that a finite graph is bipartite if and only if it does not
contain a cycle of odd length.

%\item Ivanov, p.\ 99, Problem 13.

\end{enumerate}
\end{document}
