Complete-graph extremality conjecture for mean subtree order
Statement
Let be a graph with vertices, and let denote its mean subtree order. Let be the complete graph on vertices.
Complete-graph extremality conjecture. For every graph with vertices,
This is the maximum part of the main extremal problem for mean subtree order. The source identifies it as 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.