Largest sparse subgraphs of random graphs
For the Erdős–Rényi random graph G<sub>n,p</sub>, we give a precise asymptotic formula for the size <em>â<sub>1</sub></em><em>(G<sub>n,p</sub></em>) of a largest vertex subset in G<sub>n,p</sub> that induces a subgraph with aver...
| Main Authors: | , , |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado: |
Elsevier
2012
|
Search Result 1
Search Result 2
