Ath–Sobel conjecture on sparse uniformly most reliable graphs
Statement
Let be the class of connected simple graphs on vertices and edges, and define its corank by . A uniformly most reliable graph (UMRG) is a graph in this class whose reliability is at least that of every other member for every edge-failure probability . Ath–Sobel conjecture. If is nonempty, , and , then contains at least one UMRG. The conjecture extends the known characterization for corank at most ; the supplied text gives no resolution of the stated cases.
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.