\documentclass[12pt]{article}
\usepackage{latexsym}
\usepackage{amssymb,amsmath}
\usepackage[pdftex]{graphicx}
\topmargin = 0.1in \textwidth=5.7in \textheight=8.6in
\oddsidemargin = 0.2in \evensidemargin = 0.2in
\begin{document}
\begin{center}
\large
COMPUTER SCIENCE 20, SPRING 2012 \\
DISCRETE MATHEMATICS FOR COMPUTER SCIENCE\\
\medskip
Class \#19 (Connectivity)
\end{center}
\paragraph{Homework, due in hard copy Monday 3/26/2012 at 10:10am}
\paragraph{Please write your TF's name on your homework, and list the names of any students with whom you collaborated.}
\begin{enumerate}
%\item Prove that any simple graph $G$ has a \emph{unique} spanning tree if and only if it has no cycles and is connected.
%\item Prove that any connected simple graph $G$ has no cycles only if it has a \emph{unique} spanning tree.
\item Prove that if a connected simple graph $G$ has no cycles then it has a \emph{unique} spanning tree.
\end{enumerate}
\end{document}