Monotonicity of worst-case bottleneck values for degree-bounded spanning trees
Statement
Let be a root vertex with children , where , the angles between children with respect to are at least , and all children have radial distance . Let be the optimal bottleneck path that starts at and visits all children, and suppose that the children are placed to maximise the bottleneck length of . Likewise, let be a root vertex with children , with pairwise angles at least and radial distances equal to . Let be the optimal bottleneck path that starts at and visits all children, and suppose that the children are placed to maximise the bottleneck length of . Monotonicity conjecture. Then . This asserts that adding a child cannot increase the worst-case bottleneck value. The claim is motivated by analytical and experimental point sets, but 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.