ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A binary tree is a tree in which every vertex has degree 11 or 33. A rooted binary tree is a rooted tree whose root has degree 22 and whose other vertices have degree 11 or 33. A rgood binary tree is a rooted greedy binary tree with root degree 22 and degree sequence consisting of vertices of degrees 33, 22, and 11. A binary caterpillar consists of a path with pendant vertices such that every internal vertex has degree 33. For a tree TT, let C(T)C(T), CT(T)CT(T), and Core(T)Core(T) denote its middle parts, and let d(A,B)d(A,B) denote the distance between middle parts AA and BB. The eccentricity of a vertex is its maximum distance from any vertex.

Extremal middle-parts conjecture. Among binary trees of order nn, the tree TT that maximizes d(CT(T),C(T))d(CT(T), C(T)) 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 d(Core(T),CT(T))d(Core(T), CT(T)) as well as d(Core(T),C(T))d(Core(T), C(T)).

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 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.