ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 1–3 tree is a tree in which every vertex has degree either 11 or 33. Narins–Pokrovskiy–Szabó conjecture. Every 1–3 tree TT of order nn has leaf-to-leaf paths of at least

log⁡(n+2)−1\log(n+2)-1

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 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.