Brown–Colbourn conjecture on all-terminal reliability roots
Statement
Let be a connected graph, and let denote its all-terminal reliability polynomial in the edge-failure probability . A complex number is an all-terminal reliability root if . Brown–Colbourn conjecture. If is a root of , then
Equivalently, all all-terminal reliability roots lie in the unit disk. The conjecture is false in general, although it holds for series-parallel graphs; counterexamples were found by Sokal and Royle.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.