\documentclass[11pt]{article}
\usepackage[letterpaper, left=1in, top=1in, bottom=1in, right=1in]{geometry}
\usepackage{verbatim}
\setlength{\parindent}{0in}
\pagestyle{empty}
\begin{document}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Combinatorics}
\par
\textsc{Seminar}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Graphs close to being hamiltonian}
\end{center}
\vspace{\fill}
\begin{center}\Large
Peter Horak\par
University of Washington, Tacoma
\end{center}
\vspace{\fill}
\textbf{Abstract:} There are several ways how to relax the property that a graph possesses a hamiltonian path/cycle. It is usually done if we are not able to show that the graph is hamiltonian, or if we want to measure how close the graph is to being Hamiltonian.

\

In this talk we will present problems and results of the above type. In particular, we will discuss the famous Middle Layer Problem.\vspace{\fill}
\begin{center}\Large
Friday, February 15, 2008, 5:00 pm\par
Mathematics and Science Center: W201
\end{center}
\vspace{\fill}
\begin{center}\Large

\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}