[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Ascending Subgraph Decompositions of Tournaments of Order 6n + 3

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In 1987, Alavi, Boals, Chartrand, Erdös, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). Though several classes of graphs have been shown to have an ASD, the conjecture remains open. In this paper, we investigate the similar problem for tournaments. In particular, using Kirkman Triple Systems, we will show that all tournaments of order 6n + 3 have an ASD.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alavi Y., Boals A.J., Chartrand G., Erdös P., Oellermann O.: The ascending subgraph decomposition problem. Congr. Numer. 58, 7–14 (1987)

    MathSciNet  Google Scholar 

  2. Chartrand G., Lesniak L.: Graphs & Digraphs, 4th ed. Chapman & Hall/CRC, Boca Raton (2005)

    MATH  Google Scholar 

  3. Ray-Chaudhuri, D.K., Wilson, R.M.: Solution to Kirkman’s schoolgirl problem. Combinatorics 19, 187–203 (1971) (Proceedings of Symposia in Pure Mathematics, University of California, Los Angeles, CA, 1968)

    Google Scholar 

  4. Moon J.: Topics on Tournaments. Holt Rinehart and Winston, New York (1968)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN, 38238, USA

    Brian C. Wagner

Authors
  1. Brian C. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brian C. Wagner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wagner, B.C. Ascending Subgraph Decompositions of Tournaments of Order 6n + 3. Graphs and Combinatorics 29, 1951–1959 (2013). https://doi.org/10.1007/s00373-012-1236-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1236-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation