The branch-type conjecture for sufficiently large minimal-ABC trees
The branch-type conjecture for sufficiently large minimal-ABC trees
Let 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 -branches.
Branch-type conjecture. For sufficiently large , minimal-ABC trees have only -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.
Sources & referencesView supporting material
Primary source
Darko Dimitrov and Zhibin Du, “Complete characterization of the minimal-ABC trees”, arXiv:2110.14712 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.