ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, let ee join two distinct vertices of GG, and let G+eG+e be the graph obtained by adding that edge. Write μ(G)\mu(G) for the subtree density of GG. Density monotonicity conjecture. Then

μ(G)<μ(G+e).\mu(G)<\mu(G+e).

The paper notes that adding an edge can decrease density for disconnected graphs, and conjectures that this cannot happen for connected graphs. No resolution is given in the supplied text.

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.