The nine-\B_2-branch conjecture for minimal-ABC trees
Statement
Let a minimal-ABC tree be a tree minimizing the atom-bond connectivity index among trees of the relevant order, and let a -branch denote the branch type used in the paper's classification of such trees.
Nine--branch conjecture. A minimal-ABC tree can contain at most nine -branches.
The paper proves an upper bound of eleven -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.