Path-maximizes analytic spread among trees
Statement
Let and be trees on and vertices, respectively, and fix and . For a positive integer , define as the tree on vertices with edge set
and define as the tree on vertices obtained by identifying with in the disjoint union of and , then adjoining the tail with edges . Path-maximization conjecture. For every graph ,
The proposed comparison says that separating the two trees and joining them by a path does not decrease analytic spread relative to identifying the attachment vertices and adding a tail. The source notes that this would imply for every -vertex tree and every graph , but gives no proof or resolution.
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.