Narins–Pokrovskiy–Szabó conjecture on short leaf-to-leaf path lengths
Statement
A 1–3 tree is a tree in which every vertex has degree either or . For a tree, a leaf-to-leaf path is a path whose endpoints are leaves. Narins–Pokrovskiy–Szabó conjecture. There exist a constant and a function with as such that every 1–3 tree of order contains at least distinct leaf-to-leaf path lengths between and . The source gives upper and lower bounds with different exponents for this short-length problem, so the conjecture remains open.
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.