The Brown-Colbourn conjecture on zeros of reliability polynomials is false
DOI10.1016/j.jctb.2004.03.008zbMath1052.05038arXivmath/0301199WikidataQ56893253 ScholiaQ56893253MaRDI QIDQ598476
Alan D. Sokal, Gordon F. Royle
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0301199
Potts model; Tutte polynomial; reliability polynomial; all-terminal reliability; Brown-Colbourn conjecture
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
90B15: Stochastic network models in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
05C99: Graph theory
94C15: Applications of graph theory to circuits and networks
68M15: Reliability, testing and fault tolerance of networks and computer systems
05C40: Connectivity
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reliability polynomials and their asymptotic limits for families of graphs
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Topology of series-parallel networks
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- An Algebraic Proof of Kirchhoff's Network Theorem
- Roots of the Reliability Polynomials
- Graph Classes: A Survey
- Zeros of Reliability Polynomials and f-vectors of Matroids
- Chromatic Roots are Dense in the Whole Complex Plane