On the spread of random graphs

On the spread of random graphs

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

Bibliografske podrobnosti
Main Authors:	McDiarmid, C, Addario-Berry, L, Janson, S
Format:	Journal article
Izdano:	Cambridge University Press 2014

Podobne knjige/članki

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

Random graphs on surfaces.
od: McDiarmid, C
Izdano: (2008)

Random perfect graphs
od: McDiarmid, C, et al.
Izdano: (2018)

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

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

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

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

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

Bisecting sparse random graphs.
od: Luczak, M, et al.
Izdano: (2001)

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

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

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

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

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

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

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

Random planar graphs
od: McDiarmid, C, et al.
Izdano: (2005)

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph Imperfection.
od: Gerke, S, et al.
Izdano: (2001)

Random cubic planar graphs.
od: Bodirsky, M, et al.
Izdano: (2007)

Connectivity for bridge-alterable graph classes
od: McDiarmid, C
Izdano: (2013)

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

The number of disk graphs
od: McDiarmid, C, et al.
Izdano: (2014)

The number of disk graphs.
od: McDiarmid, C, et al.
Izdano: (2014)

Graph Imperfection II.
od: Gerke, S, et al.
Izdano: (2001)

Counting disk graphs.
od: McDiarmid, C, et al.
Izdano: (2011)

On the divisibility of graphs
od: Hoang, C, et al.
Izdano: (2002)

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