Contracting a pendant edge can increase the mean subtree order
Source: hexagonmath.org/abs/2611.00151v2
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00151
curl -X POST /api/v1/records/hexagon/2611.00151/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00151/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'