The Merino-Welsh Conjecture holds for Series-Parallel Graphs
classification
🧮 math.CO
keywords
conjecturegraphgraphsmerino-welshorientationsseries-parallelacyclicasserts
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.