Geodesic
Efficient covering designs of the complete graph
The electronic journal of combinatorics, Tome 4 (1997) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $H$ be a graph. We show that there exists $n_0=n_0(H)$ such that for 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.
DOI : 10.37236/1295
Classification : 05B05, 05B40, 05B30, 51E05, 94C30, 62K05, 62K10
Mots-clés : covering 
@article{10_37236_1295,
     author = {Yair Caro and Raphael Yuster},
     title = {Efficient covering designs of the complete graph},
     journal = {The electronic journal of combinatorics},
     year = {1997},
     volume = {4},
     number = {1},
     doi = {10.37236/1295},
     zbl = {0885.05019},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1295/}
}
TY  - JOUR
AU  - Yair Caro
AU  - Raphael Yuster
TI  - Efficient covering designs of the complete graph
JO  - The electronic journal of combinatorics
PY  - 1997
VL  - 4
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1295/
DO  - 10.37236/1295
ID  - 10_37236_1295
ER  - 
%0 Journal Article
%A Yair Caro
%A Raphael Yuster
%T Efficient covering designs of the complete graph
%J The electronic journal of combinatorics
%D 1997
%V 4
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1295/
%R 10.37236/1295
%F 10_37236_1295
Yair Caro; Raphael Yuster. Efficient covering designs of the complete graph. The electronic journal of combinatorics, Tome 4 (1997) no. 1. doi: 10.37236/1295

Cité par Sources :