Cameron–Mol conjecture on decreasing mean subtree order after adding k edges
Statement
Let be a positive integer. Let and be connected graphs on the same vertex set, with and exactly edges added, so that
Cameron–Mol's conjecture. For every positive integer , there exist such graphs satisfying
The paper confirms this conjecture and strengthens it by proving that infinitely many pairs exist for every .
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.