Broken circuit complexes of series-parallel networks

DOI10.1016/J.EJC.2015.04.009MaRDI QIDQ499446zbMATH OpenOpenAlexFDO

Authors Dinh Van Le

Publication date 30 September 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.1728

zbMATH Keywords

projective equivalencetransversal matroidmatrix representation for matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: Let $(h_0,h_1,ldots,h_s)$ with $h_{s}e0$ 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}geq{h}_2$ when $sgeq4$.

Recommendations

• On the broken-circuit complex of graphs
• Flawlessness of \(h\)-vectors of broken circuit complexes
• Circuit and bond polytopes on series-parallel graphs
• Monomial bases for broken circuit complexes
• Zeros of Reliability Polynomials and f-vectors of Matroids

Cites work

• scientific article; zbMATH DE number 3959442 (Why is no real title available?)
• scientific article; zbMATH DE number 4027488 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 67325 (Why is no real title available?)
• scientific article; zbMATH DE number 3547324 (Why is no real title available?)
• scientific article; zbMATH DE number 3586175 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• A Combinatorial Model for Series-Parallel Networks
• A characterisation of binary transversal structures
• A higher invariant for matroids
• Broken circuit complexes and hyperplane arrangements
• Broken circuit complexes: Factorizations and generalizations
• CHARACTERIZATION OF ATOMIC MATROIDS
• Chromatic polynomials and order ideals of monomials
• Combinatorics and commutative algebra.
• Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
• Homological properties of Orlik-Solomon algebras
• Hyperplane arrangement cohomology and monomials in the exterior algebra
• Induced cycle structure and outerplanarity
• On Crapo's Beta Invariant for Matroids
• On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Parallel recognition of series-parallel graphs
• TRANSVERSAL MATROIDS, BASE-ORDERABLE MATROIDS, AND GRAPHS
• The Broken-Circuit Complex
• The Tutte polynomial characterizes simple outerplanar graphs
• The Tutte polynomial. I: General theory
• The broken-circuit complex: its structure and factorizations
• Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
• What can be said about pure O-sequences?
• \( h\)-vectors of matroids and logarithmic concavity
• g-elements of matroid complexes.

Cited in

(1)

• The \(h\)-vectors of PS ear-decomposable graphs

This page was built for publication: Broken circuit complexes of series-parallel networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499446)