Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424426 | European Journal of Combinatorics | 2011 | 13 Pages |
Abstract
For fixed positive integers tâ¥3 and k, consider the class of graphs which have at most k disjoint minors isomorphic to a t-star. We shall see that almost all of these graphs contain k vertices such that deleting them leaves a graph with no such minor. This holds for both labelled and unlabelled graphs, and answers a question of Bernardi, Noy and Welsh. We also estimate the asymptotic proportion of graphs in the class which do not have this property.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Colin McDiarmid,