Connected-graph contraction conjecture for mean subtree order
Statement
Let be a connected graph and let . Write for the graph obtained by contracting , and let denote mean subtree order.
Connected-graph contraction conjecture. Contracting any edge should reduce the mean subtree order by at least , with equality only for a path:
with equality if and only if is a path. The source presents this as a proposed generalisation of the proved tree case and says that proving it would imply the path-minimum result.
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.