ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RnR_n be the tree obtained, for n≥4n\geq 4, by subdividing once an edge of the star Sn−1S_{n-1}, and let av1(T)av_1(T) denote the average size of the 11-nearly independent vertex sets of a tree TT. Extremal tree conjecture. The tree RnR_n reaches the maximum value of av1av_1 over the set of all nn-vertex trees. The preceding theorem establishes that the maximum has the form n/2+δnn/2+\delta_n for n>8n>8, with 0<δn<1/20<\delta_n<1/2, and that the bounds are asymptotically sharp; the conjecture identifies RnR_n as an extremal tree.

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.