On graphs with few disjoint t-star minors.

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, et al.
出版: (2014)

Random graphs with few disjoint cycles
由: Kurauskas, V, et al.
出版: (2010)

Random unlabelled graphs containing few disjoint cycles.
由: Kang, M, et al.
出版: (2011)

Random Graphs from a Minor-Closed Class.
由: McDiarmid, C
出版: (2009)

Random graphs from a weighted minor-closed class
由: McDiarmid, C
出版: (2012)

On the purity of minor-closed classes of graphs
由: McDiarmid, C, et al.
出版: (2018)

Random graphs on surfaces.
由: McDiarmid, C
出版: (2008)

Graph Imperfection.
由: Gerke, S, et al.
出版: (2001)

Connectivity for bridge-alterable graph classes
由: McDiarmid, C
出版: (2013)

Counting disk graphs.
由: McDiarmid, C, et al.
出版: (2011)

The number of disk graphs
由: McDiarmid, C, et al.
出版: (2014)

Graph Imperfection II.
由: Gerke, S, et al.
出版: (2001)

On the critical densities of minor-closed classes
由: McDiarmid, C, et al.
出版: (2018)

The number of disk graphs.
由: McDiarmid, C, et al.
出版: (2014)

On the divisibility of graphs
由: Hoang, C, et al.
出版: (2002)

On the chromatic number of random geometric graphs
由: McDiarmid, C, et al.
出版: (2011)

Integer realizations of disk and segment graphs
由: McDiarmid, C, et al.
出版: (2011)

Integer realizations of disk and segment graphs
由: McDiarmid, C, et al.
出版: (2011)

On the chromatic number of random geometric graphs
由: McDiarmid, C, et al.
出版: (2011)

On the Number of Edges in Random Planar Graphs.
由: Gerke, S, et al.
出版: (2004)

Connectivity for random graphs from a weighted bridge-addable class
由: McDiarmid, C
出版: (2012)

Random perfect graphs
由: McDiarmid, C, et al.
出版: (2018)

Graph Imperfection with a Co-Site Constraint.
由: Gerke, S, et al.
出版: (2004)

Colouring proximity graphs in the plane
由: McDiarmid, C, et al.
出版: (1999)

Bisecting sparse random graphs.
由: Luczak, M, et al.
出版: (2001)

Modularity of regular and treelike graphs
由: McDiarmid, C, et al.
出版: (2017)

Edge-maximal graphs on surfaces
由: McDiarmid, C, et al.
出版: (2017)

The Number of Bits Needed to Represent a Unit Disk Graph.
由: McDiarmid, C, et al.
出版: (2010)

The t-improper chromatic number of random graphs
由: Kang, R, et al.
出版: (2008)

The t-Improper Chromatic Number of Random Graphs
由: Kang, R, et al.
出版: (2010)

Modularity in random regular graphs and lattices.
由: McDiarmid, C, et al.
出版: (2013)

Recognition of unipolar and generalised split graphs
由: McDiarmid, C, et al.
出版: (2015)

Channel assignment on graphs of bounded treewidth.
由: McDiarmid, C, et al.
出版: (2003)

Modularity of Erdos-Rényi random graphs
由: McDiarmid, C, et al.
出版: (2018)

On the Maximum Degree of a Random Planar Graph.
由: McDiarmid, C, et al.
出版: (2008)

Independent sets in graphs with given minimum degree
由: Law, H, et al.
出版: (2012)

Graphs with many vertex-disjoint cycles
由: Dieter Rautenbach, et al.
出版: (2012-09-01)

Disjoint triangles and quadrilaterals in a graph
由: Wang Hong
出版: (2008-12-01)

Disjoint Secure Domination in the Join of Graphs
由: Jonecis Dayap, et al.
出版: (2016-12-01)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
由: McDiarmid, C, et al.
出版: (2001)