ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph and let e∈E(G)e\in E(G). Write G/eG/e for the graph obtained by contracting ee, and let μ\mu denote mean subtree order.

Connected-graph contraction conjecture. Contracting any edge should reduce the mean subtree order by at least 13\frac13, with equality only for a path:

μ(G)−μ(G/e)≥13,\mu(G)-\mu(G/e)\ge\frac13,

with equality if and only if GG 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 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.