Largest sparse subgraphs of random graphs

Nikolaos Fountoulakis, RJ Kang, C McDiarmid

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
208 Downloads (Pure)


For the Erdős–Rényi random graph Gn,p, we give a precise asymptotic formula for the size αˆt(Gn,p) of a largest vertex subset in Gn,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 and p, we find that this value is asymptotically almost surely concentrated on at most two explicitly given points. This generalises a result on the independence number of random graphs. For both the upper and lower bounds, we rely on large deviations inequalities for the binomial distribution.

Original languageEnglish
Pages (from-to)232–244
JournalEuropean Journal of Combinatorics
Early online date3 Jul 2013
Publication statusPublished - 1 Jan 2014
EventProccedings of the 6th European Conference on combinatorics, Graph Theory and Applications -
Duration: 1 Jan 2011 → …


Dive into the research topics of 'Largest sparse subgraphs of random graphs'. Together they form a unique fingerprint.

Cite this