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

From MaRDI portal
Publication:598476


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


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