Many short leaf-leaf path lengths in 1-3 trees
Statement
A 1-3 tree is a tree whose vertices have degrees or , and a leaf-leaf path is a path with leaf endpoints. Many-short-paths conjecture. There is a constant and a function tending to infinity such that every - tree of order contains at least
distinct leaf-leaf path lengths between and . This refines the preceding path-count question by requiring a positive proportion of all lengths up to . The paper's constructions rule out guaranteeing some sufficiently large individual path lengths, but leave open whether many short lengths must nevertheless occur.
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.