ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let vv be a root vertex with children {v1,…,vk}\{v_1, \dots, v_k\}, where k≥2k \geq 2, the angles between children with respect to vv are at least 60∘60^{\circ}, and all children have radial distance 11. Let PP be the optimal bottleneck path that starts at vv and visits all children, and suppose that the children are placed to maximise the bottleneck length bb of PP. Likewise, let ww be a root vertex with children {w1,…,wk+1}\{w_1, \dots, w_{k+1}\}, with pairwise angles at least 60∘60^{\circ} and radial distances equal to 11. Let P′P' be the optimal bottleneck path that starts at ww and visits all children, and suppose that the children are placed to maximise the bottleneck length b′b' of P′P'. Monotonicity conjecture. Then b≥b′b \geq b'. 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 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.