pith. sign in

arxiv: math/0301199 · v2 · submitted 2003-01-19 · 🧮 math.CO · cond-mat.stat-mech· math-ph· math.MP

The Brown-Colbourn conjecture on zeros of reliability polynomials is false

classification 🧮 math.CO cond-mat.stat-mechmath-phmath.MP
keywords brown-colbournconjecturefalsemultivariategraphpolynomialsreliabilityunivariate
0
0 comments X
read the original abstract

We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate Brown-Colbourn conjecture is false for certain simple planar graphs obtained from K_4 by parallel and series expansion of edges. We show, in fact, that a graph has the multivariate Brown-Colbourn property if and only if it is series-parallel.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.