BIROn - Birkbeck Institutional Research Online

    The Merino–Welsh conjecture holds for series–parallel graphs

    Noble, Steven and Royle, G.F. (2014) The Merino–Welsh conjecture holds for series–parallel graphs. European Journal of Combinatorics 38 , pp. 24-35. ISSN 0195-6698.

    [img]
    Preview
    Text
    Fulltext.pdf - Author's Accepted Manuscript

    Download (289kB) | Preview

    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.

    Metadata

    Item Type: Article
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Steven Noble
    Date Deposited: 26 Oct 2016 12:55
    Last Modified: 09 Aug 2023 12:39
    URI: https://eprints.bbk.ac.uk/id/eprint/16344

    Statistics

    Activity Overview
    6 month trend
    281Downloads
    6 month trend
    232Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item