ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a graph be finite, loopless, and without multiple edges, and let μ(G)\mu(G) denote the mean subtree order of a multigraph GG, namely the average order of its subtrees. Suppose GG is a connected graph that is not complete. Then there is a graph HH, obtained from GG by joining two distinct, nonadjacent vertices, such that μ(H)>μ(G)\mu(H)>\mu(G). This weaker conjecture is motivated by counterexamples to the stronger monotonicity claim for every edge addition; it is proved in the special case that GG 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 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.