The weaker mean subtree order conjecture for connected noncomplete graphs
Statement
Let a graph be finite, loopless, and without multiple edges, and let denote the mean subtree order of a multigraph , namely the average order of its subtrees. Suppose is a connected graph that is not complete. Then there is a graph , obtained from by joining two distinct, nonadjacent vertices, such that . This weaker conjecture is motivated by counterexamples to the stronger monotonicity claim for every edge addition; it is proved in the special case that is a tree, but remains open for general connected noncomplete graphs.
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.