The extremal conjecture for average size of 1-nearly independent sets in trees
Statement
Let be the tree obtained, for , by subdividing once an edge of the star , and let denote the average size of the -nearly independent vertex sets of a tree . Extremal tree conjecture. The tree reaches the maximum value of over the set of all -vertex trees. The preceding theorem establishes that the maximum has the form for , with , and that the bounds are asymptotically sharp; the conjecture identifies 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.