ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a connected graph, and let Rel(G;q)\mathrm{Rel}(G;q) denote its all-terminal reliability polynomial in the edge-failure probability qq. A complex number zz is an all-terminal reliability root if Rel(G;z)=0\mathrm{Rel}(G;z)=0. Brown–Colbourn conjecture. If zz is a root of Rel(G;q)\mathrm{Rel}(G;q), then

∣z∣≤1.|z|\leq 1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.