\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 Andrew Frohmader}
%
%
\medskip
\noindent
%
%
{\bf More Constructions for Tur\'{a}n's (3,4)-Conjecture}
%
%
\vskip 5mm
\noindent
%
%
%
%
For Tur\'{a}n's (3, 4)-conjecture, in the case of $n = 3k+1$ vertices,
${1 \over 2}6^{k-1}$ non-isomorphic hypergraphs are constructed that
attain the conjecture.  In the case of $n = 3k+2$ vertices, $6^{k-1}$
non-isomorphic hypergraphs are constructed that attain the conjecture.



\bye

.