\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Boris Bukh}
%
%
\medskip
\noindent
%
%
{\bf Set Families with a Forbidden Subposet}
%
%
\vskip 5mm
\noindent
%
%
%
%
We asymptotically determine the size of the largest family $\cal F$ of
subsets of $\{1,\dots,n\}$ not containing a given poset $P$ if the
Hasse diagram of $P$ is a tree. This is a qualitative generalization
of several known results including Sperner's theorem.

\bye

.
