Broken circuit complexes of series-parallel networks

Abstract

Let $(h_0,h_1,\dots ,h_s)$ with $h_s\ne 0$ be the $h$-vector of the broken circuit complex of a series-parallel network $M$. Let $G$ be a graph whose cycle matroid is $M$. We give a formula for the difference $h_{s-1}-h_1$ in terms of an ear decomposition of $G$. A number of applications of this formula are provided, including several bounds for $h_{s-1}-h_1$, a characterization of outerplanar graphs, and a solution to a conjecture on $A$-graphs posed by Fenton. We also prove that $h_{s-2}\ge h_2$ when $s\ge 4$.

Revised version

References in corpus (1)

• Broken circuit complexes and hyperplane arrangements