ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a minimal-ABC tree be a tree minimizing the atom-bond connectivity index among trees of the relevant order, and let a B2B_2-branch denote the branch type used in the paper's classification of such trees.

Nine-B2B_2-branch conjecture. A minimal-ABC tree can contain at most nine B2B_2-branches.

The paper proves an upper bound of eleven B2B_2-branches and presents nine as the conjectured sharp bound, motivated by experimental results and known examples. The assertion is not resolved in the supplied text.

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.