\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{Graduate Student Seminar}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{Maximal antichains in finite partially ordered sets}
\end{center}
\vspace{\fill}
\begin{center}\Large
Dwight Duffus\par
Emory University
\end{center}
\vspace{\fill}
\textbf{Abstract:} An antichain in a (partially) ordered set X is a subset with no comparable pairs, and a fibre in X is a subset that intersects every maximal antichain.  There are well-known combinatorial problems that involve enumeration of antichains, such as Dedekind's problem. Somewhat more recent questions concern enumeration of maximal antichains and estimates of minimum fibre sizes in ordered sets overall, and for special classes such as subset lattices.  In this talk, we will present results and problems of these types, along with some quite natural graph and hypergraph analogues.\vspace{\fill}
\begin{center}\Large
Wednesday, April 9, 2008, 4:00 pm\par
Mathematics and Science Center: W201
\end{center}
\vspace{\fill}
\begin{center}\Large
Refreshments will be served in the Department Lounge at 5:00 pm.
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}