\magnification=1440
\font\bigtenrm=cmr10 scaled\magstep4
Abstract for Yair Caro and Raphael Yuster, Efficient Covering Designs of the Complete Graph

Let $H$ be a graph. We show that there exists $n_0=n_0(H)$ such
that for {\it every} $n \geq n_0$, there is a covering of the edges of 
$K_n$ with copies of $H$ where every edge is covered at most twice and
any two copies intersect in at most one edge. Furthermore, the
covering we obtain is asymptotically optimal.



\bye