Skip to main content
SpringerLink
Log in

Ascending Subgraph Decompositions of Tournaments of Orders \(6n+2\) and \(6n+1\)

  • 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). In a previous paper, we showed that all tournaments of order \(6n+3\) have an ASD. In this paper, we will extend the result to all tournaments of order \(6n+1\) and \(6n+2\).

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.

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 and Digraphs, 4th edn. Chapman & Hall/CRC, Boca Raton (2005)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. Ray-Chaudhuri, D.K., Wilson, R.M.: Solution to Kirkman’s schoolgirl problem. Combinatorics, Proc. Sympos. Pure Math., Univ. California, Los Angeles, 1968, vol. 19, pp. 187–203 (1971)

  5. Wagner, B.: Ascending subgraph decompositions of tournaments of order \(6n+3\). Graphs Combin. 29, 1951–1959 (2013)

    Article  MathSciNet  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

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wagner, B.C. Ascending Subgraph Decompositions of Tournaments of Orders \(6n+2\) and \(6n+1\) . Graphs and Combinatorics 32, 813–822 (2016). https://doi.org/10.1007/s00373-015-1591-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1591-9

Keywords

Mathematics Subject Classification

Search

Navigation