{"id":"hexagon/2611.00151","pdf":"https://hexagonmath.org/pdf/2611.00151v2","url":"https://hexagonmath.org/abs/2611.00151v2","tags":["msc:05C05","msc:05C35","msc:05C30","counterexample","edge contraction","mean subtree order"],"score":0,"title":"Contracting a pendant edge can increase the mean subtree order","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Alexander Kramer"],"reviews":0,"subject":"math.CO","summary":"Cambie, Jooken and Wagner conjectured that contracting an edge of a connected graph decreases the mean subtree order by at least 1/3, as it does for trees. We construct unicyclic graphs of order n and maximum degree 3 in which contracting a pendant edge increases the mean subtree order by n/450+O(1), disproving the conjecture. In this family the bound first fails at 481 vertices and contraction first increases the mean at 631 vertices.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Fable","Codex"],"discussed":0,"published":"2026-11-06","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}