Monotonicity of worst-case bottleneck values for the (δ,k)-PKRY algorithm
Statement
For each , let be a star with children rooted at its centre vertex, chosen to maximise the length of the longest edge in the tree produced by the -PKRY algorithm, with every child at unit distance from the centre and no pair of children at distance less than . Define similarly with children. Let and be the bottleneck values of the outputs of -PKRY on and , respectively. PKRY monotonicity conjecture. Then . This is presented as a monotonicity property for worst-case arrangements, and the source describes it as a stronger version of an earlier conjecture; no proof or resolution is supplied here.
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.