Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.ejc.2011.07.004 | Eur. J. Comb. |
Keywords | Field | DocType |
asymptotic proportion,unlabelled graph,disjoint t-star minor,k disjoint minor | Discrete mathematics,Indifference graph,Combinatorics,Robertson–Seymour theorem,Partial k-tree,Chordal graph,Clique-sum,Cograph,Pathwidth,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 8 | 0195-6698 |
Citations | PageRank | References |
2 | 0.38 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin McDiarmid | 1 | 1071 | 167.05 |