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

Journal of Combinatorial Theory. Series B

Volumn 91, Issue 2, 2004, Pages 345-360

  Royle, Gordon ^a   Sokal, Alan D ^b  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

All terminal reliability; Brown Colbourn conjecture; Potts model; Reliability polynomial; Tutte polynomial

Indexed keywords

EID: 3242672717     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2004.03.008     Document Type: Article

References (18)

1. Ahlfors L.V. Complex Analysis 1966 McGraw-Hill New York
2. Bini D.A. Fiorentino G. Numerical computation of polynomial roots using MPSolve version 2.2 (January 2000), Software package and documentation available for download at ftp://ftp.dm.unipi.it/pub/ mpsolve/
3. Bini D.A. Fiorentino G. Design, analysis and implementation of a multiprecision polynomial rootfinder Numer. Algorithms 23 2000 127-173
4. Brandstädt A. Le Van Bang J.P. Spinrad, Graph Classes: A Survey, SIAM, Philadelphia, 1999.
5. Brown J.I. Colbourn C.J. Roots of the reliability polynomial SIAM J. Discrete Math. 5 1992 571-585
6. Chang S.-C. Shrock R. Reliability polynomials and their asymptotic limits for families of graphs J. Statist. Phys. 112 2003 1019-1077 cond-mat/0208538 at xxx.lanl.gov
7. Colbourn C.J. The Combinatorics of Network Reliability 1987 Oxford University Press New York, Oxford
8. Diestel R Graph Theory 1997 Springer New York
9. Duffin R.J Topology of series-parallel graphs J. Math. Anal. Appl. 10 1965 303-318
10. Kirchhoff G. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme gefürht wird Ann. Phys. Chem. 72 1847 497-508
11. Krantz S.G. Function Theory of Several Complex Variables 2nd Edition 1992 Wadsworth & Brooks/Cole Pacific Grove, California
12. Nerode A. Shank H. An algebraic proof of Kirchhoff's network theorem Amer. Math. Monthly 68 1961 244-247
13. Oxley J. Graphs and series-parallel networks White N Theory of Matroids 1986 97-126 Cambridge University Press Cambridge (Chapter 6)
14. Oxley J.G. Matroid Theory 1992 Oxford University Press New York
15. 2 Euclidean (Quantum) Field Theory 1993 Princeton University Press Princeton
16. Sokal A.D. Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions Combin. Probab. Comput. 10 2001 41-77 cond-mat/9904146 at xxx.lanl.gov.
17. Sokal A.D. Chromatic roots are dense in the whole complex plane Combin. Probab. Comput. 13 2004 221-261 cond-mat/0012369 at xxx.lanl.gov
18. Wagner D.G. Zeros of reliability polynomials and f-vectors of matroids Combin. Probab. Comput. 9 2000 167-190