The extremal middle-parts conjecture for binary trees
Statement
A binary tree is a tree in which every vertex has degree or . A rooted binary tree is a rooted tree whose root has degree and whose other vertices have degree or . A rgood binary tree is a rooted greedy binary tree with root degree and degree sequence consisting of vertices of degrees , , and . A binary caterpillar consists of a path with pendant vertices such that every internal vertex has degree . For a tree , let , , and denote its middle parts, and let denote the distance between middle parts and . The eccentricity of a vertex is its maximum distance from any vertex.
Extremal middle-parts conjecture. Among binary trees of order , the tree that maximizes is formed by identifying the root of an rgood binary tree with a vertex of maximum eccentricity in a binary caterpillar. The same tree structure maximizes as well as .
The conjecture proposes a common extremal structure for three distances between different middle parts of a binary tree. The source gives no resolution, so its status remains open.
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.