ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Cn,m\mathcal C_{n,m} be the class of connected simple graphs on nn vertices and mm edges, and define its corank by c=m−n+1c=m-n+1. 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 ρ∈[0,1]\rho\in[0,1]. Ath–Sobel conjecture. If Cn,m\mathcal C_{n,m} is nonempty, c∈{5,6,7,8}c\in\{5,6,7,8\}, and n≥2c−2n\geq 2c-2, then Cn,m\mathcal C_{n,m} contains at least one UMRG. The conjecture extends the known characterization for corank at most 44; 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 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.