×

A note on a packing problem in transitive tournaments. (English) Zbl 1100.05074

Summary: Let \(TT_{n}\) be a transitive tournament on \(n\) vertices. We show that for any directed acyclic graph \(G\) of order \(n\) and of size not greater than \(\frac{3(n-1)}{4}\) two directed graphs isomorphic to \(G\) are arc disjoint subgraphs of \(TT_{n}\). Moreover, this bound is generally the best possible.

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20 Directed graphs (digraphs), tournaments
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bollobás, B.: Extremal Graph Theory (Academic Press, London 1978) · Zbl 1099.05044
[2] Burns, D., Schuster, S.: J. Graph Theory 1, 277–279 (1977) · Zbl 0375.05046
[3] Gyárfás, A.: J. Graph Theory 38, 111–112 (2001)
[4] Harary, F., Moser, L.: Amer. Math. Monthly 73, 231–246 (1966)
[5] Sali, A., Simonyi, G.: Eur. J. Combin. 20, 93–99 (1999)
[6] Benhocine, A., Wojda, A.P.:J. Graph Theory 8, 335–341 (1985)
[7] Woźniak, M.: Dissertationes Math. 362, 78 (1997)
[8] Woźniak, M.: Discrete Math. 276, 379–391 (2004)
[9] Yap, H.P.: Discrete Math. 72, 395–404 (1988)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.