Proof of a conjecture of Xiao and Zamora
摘要
A wheel, defined by Tutte, is the graph obtained from a circle by adding one new vertex and joining this vertex to all vertices of the circle. We determine the maximum number of edges in a graph which does not contain vertex-disjoint wheels. This confirms a conjecture posed by Xiao and Zamora in a stronger form.