On graphs with few disjoint t-star minors.
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 gr...
Автор: | McDiarmid, C |
---|---|
Формат: | Journal article |
Мова: | English |
Опубліковано: |
2011
|
Схожі ресурси
-
Random Graphs Containing Few Disjoint Excluded Minors
за авторством: McDiarmid, C, та інші
Опубліковано: (2014) -
Random graphs with few disjoint cycles
за авторством: Kurauskas, V, та інші
Опубліковано: (2010) -
Random unlabelled graphs containing few disjoint cycles.
за авторством: Kang, M, та інші
Опубліковано: (2011) -
Random Graphs from a Minor-Closed Class.
за авторством: McDiarmid, C
Опубліковано: (2009) -
Random graphs from a weighted minor-closed class
за авторством: McDiarmid, C
Опубліковано: (2012)