The Merino-Welsh conjecture holds for series-parallel graphs

S.D. Noble; Gordon Royle

doi:10.1016/j.ejc.2013.11.002

The Merino-Welsh conjecture holds for series-parallel graphs

S.D. Noble, Gordon Royle

Graduate Research School

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

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. © 2013 Elsevier Ltd.

Original language	English
Pages (from-to)	24-35
Journal	European Journal of Combinatorics
Volume	38
DOIs	https://doi.org/10.1016/j.ejc.2013.11.002
Publication status	Published - 2014

Access to Document

10.1016/j.ejc.2013.11.002

Cite this

@article{16a9d84ec248418092fabb2066f91fdd,

title = "The Merino-Welsh conjecture holds for series-parallel graphs",

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. {\textcopyright} 2013 Elsevier Ltd.",

author = "S.D. Noble and Gordon Royle",

year = "2014",

doi = "10.1016/j.ejc.2013.11.002",

language = "English",

volume = "38",

pages = "24--35",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - The Merino-Welsh conjecture holds for series-parallel graphs

AU - Noble, S.D.

AU - Royle, Gordon

PY - 2014

Y1 - 2014

N2 - 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. © 2013 Elsevier Ltd.

AB - 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. © 2013 Elsevier Ltd.

U2 - 10.1016/j.ejc.2013.11.002

DO - 10.1016/j.ejc.2013.11.002

M3 - Article

SN - 0195-6698

VL - 38

SP - 24

EP - 35

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

The Merino-Welsh conjecture holds for series-parallel graphs

Abstract

Access to Document

Fingerprint

Cite this