On the spread of random graphs
<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...
Prif Awduron: | McDiarmid, C, Addario-Berry, L, Janson, S |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
Cambridge University Press
2014
|
Eitemau Tebyg
-
On the spread of random graphs
gan: Addario-Berry, L, et al.
Cyhoeddwyd: (2009) -
Random graphs on surfaces.
gan: McDiarmid, C
Cyhoeddwyd: (2008) -
Random perfect graphs
gan: McDiarmid, C, et al.
Cyhoeddwyd: (2018) -
Random Graphs from a Minor-Closed Class.
gan: McDiarmid, C
Cyhoeddwyd: (2009) -
Acyclic improper colourings of graphs with bounded maximum degree
gan: Addario-Berry, L, et al.
Cyhoeddwyd: (2010)