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...

Fuld beskrivelse

Bibliografiske detaljer
Hovedforfatter:	McDiarmid, C
Format:	Journal article
Sprog:	English
Udgivet:	2011

Lignende værker

Random Graphs Containing Few Disjoint Excluded Minors
af: McDiarmid, C, et al.
Udgivet: (2014)

Random graphs with few disjoint cycles
af: Kurauskas, V, et al.
Udgivet: (2010)

Random unlabelled graphs containing few disjoint cycles.
af: Kang, M, et al.
Udgivet: (2011)

Random Graphs from a Minor-Closed Class.
af: McDiarmid, C
Udgivet: (2009)

Random graphs from a weighted minor-closed class
af: McDiarmid, C
Udgivet: (2012)

On the purity of minor-closed classes of graphs
af: McDiarmid, C, et al.
Udgivet: (2018)

Random graphs on surfaces.
af: McDiarmid, C
Udgivet: (2008)

Graph Imperfection.
af: Gerke, S, et al.
Udgivet: (2001)

Connectivity for bridge-alterable graph classes
af: McDiarmid, C
Udgivet: (2013)

Counting disk graphs.
af: McDiarmid, C, et al.
Udgivet: (2011)

The number of disk graphs
af: McDiarmid, C, et al.
Udgivet: (2014)

Graph Imperfection II.
af: Gerke, S, et al.
Udgivet: (2001)

On the critical densities of minor-closed classes
af: McDiarmid, C, et al.
Udgivet: (2018)

The number of disk graphs.
af: McDiarmid, C, et al.
Udgivet: (2014)

On the divisibility of graphs
af: Hoang, C, et al.
Udgivet: (2002)

On the chromatic number of random geometric graphs
af: McDiarmid, C, et al.
Udgivet: (2011)

Integer realizations of disk and segment graphs
af: McDiarmid, C, et al.
Udgivet: (2011)

Integer realizations of disk and segment graphs
af: McDiarmid, C, et al.
Udgivet: (2011)

On the chromatic number of random geometric graphs
af: McDiarmid, C, et al.
Udgivet: (2011)

On the Number of Edges in Random Planar Graphs.
af: Gerke, S, et al.
Udgivet: (2004)

Connectivity for random graphs from a weighted bridge-addable class
af: McDiarmid, C
Udgivet: (2012)

Random perfect graphs
af: McDiarmid, C, et al.
Udgivet: (2018)

Graph Imperfection with a Co-Site Constraint.
af: Gerke, S, et al.
Udgivet: (2004)

Colouring proximity graphs in the plane
af: McDiarmid, C, et al.
Udgivet: (1999)

Bisecting sparse random graphs.
af: Luczak, M, et al.
Udgivet: (2001)

Modularity of regular and treelike graphs
af: McDiarmid, C, et al.
Udgivet: (2017)

Edge-maximal graphs on surfaces
af: McDiarmid, C, et al.
Udgivet: (2017)

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

The t-improper chromatic number of random graphs
af: Kang, R, et al.
Udgivet: (2008)

The t-Improper Chromatic Number of Random Graphs
af: Kang, R, et al.
Udgivet: (2010)

Modularity in random regular graphs and lattices.
af: McDiarmid, C, et al.
Udgivet: (2013)

Recognition of unipolar and generalised split graphs
af: McDiarmid, C, et al.
Udgivet: (2015)

Channel assignment on graphs of bounded treewidth.
af: McDiarmid, C, et al.
Udgivet: (2003)

Modularity of Erdos-Rényi random graphs
af: McDiarmid, C, et al.
Udgivet: (2018)

On the Maximum Degree of a Random Planar Graph.
af: McDiarmid, C, et al.
Udgivet: (2008)

Independent sets in graphs with given minimum degree
af: Law, H, et al.
Udgivet: (2012)

Graphs with many vertex-disjoint cycles
af: Dieter Rautenbach, et al.
Udgivet: (2012-09-01)

Disjoint triangles and quadrilaterals in a graph
af: Wang Hong
Udgivet: (2008-12-01)

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

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
af: McDiarmid, C, et al.
Udgivet: (2001)