Geodesic
Packing of three copies of a digraph into the transitive tournament
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 443-456

Voir la notice de l'article provenant de la source Library of Science

In this paper, we show that if the number of arcs in an oriented graph G (of order n) without directed cycles is sufficiently small (not greater than [2/3] n-1), then there exist arc disjoint embeddings of three copies of G into the transitive tournament TTₙ. It is the best possible bound.
Keywords: packing of digraphs, transitive tournament 
@article{DMGT_2004_24_3_a7,
     author = {Pil\'sniak, Monika},
     title = {Packing of three copies of a digraph into the transitive tournament},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {443--456},
     publisher = {mathdoc},
     volume = {24},
     number = {3},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a7/}
}
TY  - JOUR
AU  - Pilśniak, Monika
TI  - Packing of three copies of a digraph into the transitive tournament
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 443
EP  - 456
VL  - 24
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a7/
LA  - en
ID  - DMGT_2004_24_3_a7
ER  - 
%0 Journal Article
%A Pilśniak, Monika
%T Packing of three copies of a digraph into the transitive tournament
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 443-456
%V 24
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a7/
%G en
%F DMGT_2004_24_3_a7
Pilśniak, Monika. Packing of three copies of a digraph into the transitive tournament. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 3, pp. 443-456. http://geodesic.mathdoc.fr/item/DMGT_2004_24_3_a7/