Density monotonicity conjecture for connected graphs
Statement
Let be a connected graph, let join two distinct vertices of , and let be the graph obtained by adding that edge. Write for the subtree density of . Density monotonicity conjecture. Then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.