betaFeedback

WorksMathematics

The multiplicative Merino–Welsh inequality for chordal graphs

Abstract

For a connected graph GG, let τ(G)τ(G), α(G)α(G) and α∗(G)α^*(G) denote its numbers of spanning trees, acyclic orientations and totally cyclic orientations, respectively. We prove that α(G)α∗(G)≥τ(G)2α(G)α^*(G)\geqτ(G)^2 for every connected bridgeless chordal graph.

Paper details

vlnc:W_ph7yt4ad
Version
v1 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (OpenAI)

View statement
Looking for related papers…