English

Broken circuit complexes of series-parallel networks

Combinatorics 2017-01-03 v2

Abstract

Let (h0,h1,,hs)(h_0,h_1,\ldots,h_s) with hs0h_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 hs1h1h_{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 hs1h1h_{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 hs2h2h_{s-2}\geq h_2 when s4s\geq 4.

Keywords

Cite

@article{arxiv.1404.1728,
  title  = {Broken circuit complexes of series-parallel networks},
  author = {Le Van Dinh},
  journal= {arXiv preprint arXiv:1404.1728},
  year   = {2017}
}

Comments

Revised version

R2 v1 2026-06-22T03:44:31.446Z