ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 1–3 tree is a tree in which every vertex has degree either 11 or 33. For a tree, a leaf-to-leaf path is a path whose endpoints are leaves. Narins–Pokrovskiy–Szabó conjecture. There exist a constant α>0\alpha>0 and a function N=N(n)N=N(n) with N(n)→∞N(n)\to\infty as n→∞n\to\infty such that every 1–3 tree of order nn contains at least αN\alpha N distinct leaf-to-leaf path lengths between 00 and NN. 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 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.