On the spread of random graphs

On the spread of random graphs

Veure altres versions (1)

<p style="text-align:justify;"> The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distrib...

Descripció completa

Dades bibliogràfiques
Autors principals:	McDiarmid, C, Addario-Berry, L, Janson, S
Format:	Journal article
Publicat:	Cambridge University Press 2014

Ítems similars

On the spread of random graphs
per: Addario-Berry, L, et al.
Publicat: (2009)

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

Random perfect graphs
per: McDiarmid, C, et al.
Publicat: (2018)

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

Acyclic improper colourings of graphs with bounded maximum degree
per: Addario-Berry, L, et al.
Publicat: (2010)

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

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

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

Bisecting sparse random graphs.
per: Luczak, M, et al.
Publicat: (2001)

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

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

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

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

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

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

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

Random planar graphs
per: McDiarmid, C, et al.
Publicat: (2005)

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

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

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

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

Upper bounds on the non-3-colourability threshold of random graphs.
per: Fountoulakis, N, et al.
Publicat: (2002)

Largest sparse subgraphs of random graphs
per: Fountoulakis, N, et al.
Publicat: (2014)

Largest sparse subgraphs of random graphs.
per: Fountoulakis, N, et al.
Publicat: (2011)

The t-stability number of a random graph
per: Fountoulakis, N, et al.
Publicat: (2008)

Clique colouring of binomial random graphs
per: McDiarmid, C, et al.
Publicat: (2018)

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

Colouring random geometric graphs
per: Colin J. H. McDiarmid, et al.
Publicat: (2005-01-01)

Upper bounds on the non-3-colourability threshold of random graphs
per: Nikolaos Fountoulakis, et al.
Publicat: (2002-01-01)

Upper bounds on the non- 3-colourability threshold of random graphs
per: Nikolaos Fountoulakis, et al.
Publicat: (2002-12-01)

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

Random cubic planar graphs.
per: Bodirsky, M, et al.
Publicat: (2007)

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

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

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

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

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

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

On the divisibility of graphs
per: Hoang, C, et al.
Publicat: (2002)

Uniform multicommodity flow through the complete graph with random edge-capacities.
per: Aldous, D, et al.
Publicat: (2009)