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)