On the critical densities of minor-closed classes

On the critical densities of minor-closed classes

Given a minor-closed class A of graphs, let βAdenote the supremum over all graphs in A of the ratio of edges to vertices. We investigate the set B of all such values βA, taking further the project begun by Eppstein. Amongst other results, we determine the small values in B (those up to 2); we show t...

Descripció completa

Dades bibliogràfiques
Autors principals:	McDiarmid, C, Przykucki, M
Format:	Journal article
Publicat:	Elsevier 2018

Ítems similars

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

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

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

On graphs with few disjoint t-star minors.
per: McDiarmid, C
Publicat: (2011)

Connectivity for bridge-alterable graph classes
per: McDiarmid, C
Publicat: (2013)

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

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

Random graphs from a block-stable class
per: McDiarmid, C, et al.
Publicat: (2016)

Connectivity for bridge-addable monotone graph classes
per: Berry, L, et al.
Publicat: (2011)

Clustered colouring in minor-closed classes
per: Norin, S, et al.
Publicat: (2019)

On the span in channel assignment problems: Bounds, computing and counting
per: McDiarmid, C
Publicat: (2003)

Quicksort and Large Deviations.
per: McDiarmid, C
Publicat: (2012)

On The Span Of A Random Channel Assignment Problem.
per: McDiarmid, C
Publicat: (2007)

A doubly cyclic channel assignment problem
per: McDiarmid, C
Publicat: (1997)

Frequency-distance constraints with large distances
per: McDiarmid, C
Publicat: (2000)

Hypergraph colouring and the Lovász Local Lemma
per: McDiarmid, C
Publicat: (1997)

Random graphs on surfaces.
per: McDiarmid, C
Publicat: (2008)

On the span in channel assignment problems: bounds, computing and counting
per: McDiarmid, C
Publicat: (2003)

Concentration For Independent Permutations.
per: McDiarmid, C
Publicat: (2002)

Random channel assignment in the plane.
per: McDiarmid, C
Publicat: (2003)

Advocating for the Health Worker
per: Melissa McDiarmid
Publicat: (2019-01-01)

The number of disk graphs
per: McDiarmid, C, et al.
Publicat: (2014)

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

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

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

The number of disk graphs.
per: McDiarmid, C, et al.
Publicat: (2014)

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

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

Graph Imperfection.
per: Gerke, S, et al.
Publicat: (2001)

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

Graph Imperfection II.
per: Gerke, S, et al.
Publicat: (2001)

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

Channel Assignment with Large Demands.
per: Gerke, S, et al.
Publicat: (2001)

Counting disk graphs.
per: McDiarmid, C, et al.
Publicat: (2011)

On the maximum queue length in the supermarket model
per: Luczak, M, et al.
Publicat: (2006)

Balanced routing of random calls
per: Luczak, M, et al.
Publicat: (2008)

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

On the power of two choices: Balls and bins in continuous time
per: Luczak, M, et al.
Publicat: (2005)

Asymptotic distributions and chaos for the supermarket model
per: Luczak, M, et al.
Publicat: (2007)

Concentration for locally acting permutations
per: Luczak, M, et al.
Publicat: (2003)