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...
| Prif Awduron: | , , |
|---|---|
| Fformat: | Journal article |
| Iaith: | English |
| Cyhoeddwyd: |
2014
|