Title

Dense subgraphs in random graphs

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

Share

COinS