Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Ascending Subgraph Decompositions of Tournaments of Order \( 6n + 5 \)

Brian C. Wagner1
1 Department of Mathematics and Statistics University of Tennessee at Martin Martin, TN 38238, USA
  • Published: 30/12/2019

Abstract

In 1987, Alavi, Boals, Chartrand, Erdös, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In previous papers, we showed that all tournaments of order congruent to 1, 2, or 3 mod 6 have an ASD. In this paper, we will consider the case where the tournament has order congruent to 5 mod 6.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Brian C. Wagner. Ascending Subgraph Decompositions of Tournaments of Order \( 6n + 5 \)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 111. -. DOI: .