Skip to main content
SpringerLink
Log in

A Note on a Packing Problem in Transitive Tournaments

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

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 two directed graphs isomorphic to G are arc disjoint subgraphs of TT n . Moreover, this bound is generally the best possible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollobás, B.: Extremal Graph Theory (Academic Press, London 1978)

  2. Burns, D., Schuster, S.: J. Graph Theory 1, 277–279 (1977)

    Google Scholar 

  3. Gyárfás, A.: J. Graph Theory 38, 111–112 (2001)

    Google Scholar 

  4. Harary, F., Moser, L.: Amer. Math. Monthly 73, 231–246 (1966)

    Google Scholar 

  5. Sali, A., Simonyi, G.: Eur. J. Combin. 20, 93–99 (1999)

    Google Scholar 

  6. Benhocine, A., Wojda, A.P.:J. Graph Theory 8, 335–341 (1985)

    Google Scholar 

  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)

Download references

Author information

Authors and Affiliations

  1. University of Science and Technology AGH, Al.Mickiewicza 30, 30-059, Kraków, Poland

    Agnieszka Görlich, Monika Pilśniak & Mariusz Woźniak

Authors
  1. Agnieszka Görlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Monika Pilśniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mariusz Woźniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research partially supported by KBN grant 2 P03A 016 18

Rights and permissions

Reprints and permissions

About this article

Cite this article

Görlich, A., Pilśniak, M. & Woźniak, M. A Note on a Packing Problem in Transitive Tournaments. Graphs and Combinatorics 22, 233–239 (2006). https://doi.org/10.1007/s00373-005-0652-x

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0652-x

Keywords

Search

Navigation