Dense subgraphs in random graphs

Authors

Paul Balister, University of MemphisFollow
Béla Bollobás, University of MemphisFollow
Julian Sahasrabudhe, Instituto Nacional de Matematica Pura E Aplicada, Rio de Janeiro
Alexander Veremyev, University of Central Florida

Abstract

For a constant γ∈[0,1] and a graph G, let ω γ (G) be the largest integer k for which there exists a k-vertex subgraph of G with at least γ[Formula presented] edges. We show that if 0

Publication Title

Discrete Applied Mathematics

Recommended Citation

Balister, P., Bollobás, B., Sahasrabudhe, J., & Veremyev, A. (2019). Dense subgraphs in random graphs. Discrete Applied Mathematics, 260, 66-74. https://doi.org/10.1016/j.dam.2019.01.032