Answers are grounded in this paper and cite their sources.
Boesch conjectured that there is always a uniformly‐most reliable graph on n points and e edges. We present an infinite family of counterexamples to this conjecture.
No takes yet. Share an insight, caveat, or question.
Myrvold et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: