Narins–Pokrovskiy–Szabó conjecture on leaf-to-leaf path lengths in 1–3 trees
Statement
A 1–3 tree is a tree in which every vertex has degree either or . Narins–Pokrovskiy–Szabó conjecture. Every 1–3 tree of order has leaf-to-leaf paths of at least
distinct lengths. The source proves this claim as a consequence of a stronger theorem for arbitrary trees with bounded maximum degree, so the conjecture is solved.
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.