ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 1-3 tree is a tree whose vertices have degrees 11 or 33, and a leaf-leaf path is a path with leaf endpoints. Many-short-paths conjecture. There is a constant α>0\alpha>0 and a function C(n)C(n) tending to infinity such that every 11-33 tree of order nn contains at least

αC(n)\alpha C(n)

distinct leaf-leaf path lengths between 00 and C(n)C(n). This refines the preceding path-count question by requiring a positive proportion of all lengths up to C(n)C(n). 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 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.