Largest sparse subgraphs of random graphs
For the Erdo{double acute}s-Rényi random graph G n,p, we give a precise asymptotic formula for the size α̂t(Gn,p) of a largest vertex subset in G n,p that induces a subgraph with average degree at most t, provided that p = p (n) is not too small and t = t (n) is not too large. In the case of fixed t...
Main Authors: | Fountoulakis, N, Kang, R, McDiarmid, C |
---|---|
格式: | Journal article |
语言: | English |
出版: |
2014
|
相似书籍
-
Largest sparse subgraphs of random graphs.
由: Fountoulakis, N, et al.
出版: (2011) -
Largest sparse subgraphs of random graphs
由: Mcdiarmid, C, et al.
出版: (2012) -
Bisecting sparse random graphs.
由: Luczak, M, et al.
出版: (2001) -
The t-stability number of a random graph
由: Fountoulakis, N, et al.
出版: (2008) -
Upper bounds on the non-3-colourability threshold of random graphs.
由: Fountoulakis, N, et al.
出版: (2002)