2013/03/26 by Steven D. Noble, Gordon F. Royle, Gordon Royle +2
Computer Science · Mathematics · #05C05 #05C31 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #math.CO #msc:05C05 #msc:05C31
paper · pdf · doi:10.48550/arxiv.1303.6416
12 pages, includes Mathematica code in Appendix
arxiv created 2013/03/26 · openalex publication_date 2013/03/26 · arxiv updated 2013/03/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Merino-Welsh conjecture asserts that the number of spanning trees of a graph is no greater than the maximum of the numbers of totally cyclic orientations and acyclic orientations of that graph. We prove this conjecture for the class of series-parallel graphs.