Dense subgraphs in random graphs
For a constant USD \gamma \in[0,1] USD and a graph USD G USD, let USD \omega_{\gamma}(G) USD be the largest integer USD k USD for which there exists a USD k USD-vertex subgraph of USD G USD with at least USD \gamma\binom{k}{2} USD edges. We show that if USD 0<p<\gamma<1 USD then...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2019
|