ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each mm, let SmS_m be a star with mm children rooted at its centre vertex, chosen to maximise the length of the longest edge in the tree produced by the (δ,k)(\delta,k)-PKRY algorithm, with every child at unit distance from the centre and no pair of children at distance less than 11. Define Sm+1S_{m+1} similarly with m+1m+1 children. Let bb and b′b' be the bottleneck values of the outputs of (δ,k)(\delta,k)-PKRY on SmS_m and Sm+1S_{m+1}, respectively. PKRY monotonicity conjecture. Then b≥b′b \geq b'. 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 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.