The fair cake-cutting conjecture for uniformly most reliable hamiltonian graphs
Statement
Let denote the fair cake-cutting graph with parameters and . A graph is uniformly most reliable for fixed order and size if its reliability polynomial is at least that of every competing graph for every edge-operational probability . Fair cake-cutting conjecture. If
then is a uniformly most reliable hamiltonian graph for . The case is described as largely open in the paper, with only some small cases known computationally; this conjecture proposes a family that is optimal under the stated divisibility condition.
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.