论文信息 - Packing of three copies of a digraph into the transitive tournament

Packing of three copies of a digraph into the transitive tournament

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 TTn. It is the best possible bound.

Monika Pilsniak

[1] J. Sheehan. SOME TOPICS IN GRAPH THEORY (London Mathematical Society Lecture Note Series 108) , 1990 .

[2] A. Pawel Wojda,et al. Triple placement of graphs , 1993, Graphs Comb..

[3] Hamamache Kheddouci,et al. On the packing of three graphs , 2001, Discret. Math..

[4] Joel H. Spencer,et al. Edge disjoint placement of graphs , 1978, J. Comb. Theory B.

[5] Hian Poh Yap,et al. Packing of graphs - a survey , 1988, Discret. Math..

[6] Mariusz Woźniak. Packing of graphs , 1997 .

[7] Béla Bollobás,et al. Packings of graphs and applications to computational complexity , 1978, J. Comb. Theory, Ser. B.

[8] H. Yap. Some Topics in Graph Theory , 1986 .

[9] David Burns,et al. Every (p, p-2) graph is contained in its complement , 1977, J. Graph Theory.

[10] Mariusz Wozniak,et al. A Note on a Packing Problem in Transitive Tournaments , 2006, Graphs Comb..