Broken circuit complexes of series-parallel networks

preprint2016arXivOpen access

Abstract

Let (h0,h1,…,hs)(h_0,h_1,\ldots,h_s) with hs≠0h_s\ne0 be the hh-vector of the broken circuit complex of a series-parallel network MM. Let GG be a graph whose cycle matroid is MM. We give a formula for the difference hs−1−h1h_{s-1}-h_1 in terms of an ear decomposition of GG. A number of applications of this formula are provided, including several bounds for hs−1−h1h_{s-1}-h_1, a characterization of outerplanar graphs, and a solution to a conjecture on AA-graphs posed by Fenton. We also prove that hs−2≥h2h_{s-2}\geq h_2 when s≥4s\geq 4.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.