\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{}
\par
\textsc{Colloquium}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Old and New Results on the Chromatic Number of Infinite Graphs}
\end{center}
\vspace{\fill}
\begin{center}\Large
Peter Komjath\par
Eotvos University, Budapest
\end{center}
\vspace{\fill}
\textbf{Abstract:} 1. We consider the following conjecture of Erdos: every uncountably chromatic graph contains an infinitely connected subgraph.

\

2. If G is a graph on some set S with uncountable chromatic number what can be said on those sets which span countably chromatic subgraphs?\vspace{\fill}
\begin{center}\Large
Thursday, February 21, 2008, 4:00 pm\par
Mathematics and Science Center: W301
\end{center}
\vspace{\fill}
\begin{center}\Large
Refreshments will be served at 3:30pm in the Department Lounge
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}