ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the order of a minimal-ABC tree, and let big vertices denote the vertices distinguished as big in the paper's branch decomposition. The branches other than those incident with the big vertices are classified as BiB_i-branches.

Branch-type conjecture. For sufficiently large nn, minimal-ABC trees have only B3B_3-branches besides the big vertices.

This is the second conjecture attributed by the paper to earlier work. The supplied text gives no resolution status, so it remains open in this database.

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.