\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 Ailian Chen, Fuji Zhang and Hao Li}
%
%
\medskip
\noindent
%
%
{\bf Rainbow $H$-Factors of Complete $s$-Uniform $r$-Partite Hypergraphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
We say a $s$-uniform $r$-partite hypergraph is complete, if it has a
vertex partition $\{V_1,V_2,...,V_r\}$ of $r$ classes and its
hyperedge set consists of all the $s$-subsets of its vertex set which
have at most one vertex in each vertex class. We denote the complete
$s$-uniform $r$-partite hypergraph with $k$ vertices in each vertex
class by ${\cal T}_{s,r}(k)$.  In this paper we prove that if $h,\
r$ and $s$ are positive integers with $2\leq s\leq r\leq h$ then there
exists a constant $k=k(h,r,s)$ so that if $H$ is an $s$-uniform
hypergraph with $h$ vertices and chromatic number $\chi(H)=r$ then any
proper edge coloring of ${\cal T}_{s,r}(k)$ has a rainbow
$H$-factor.



\bye

.