Quasi-cliques in inhomogeneous random graphs

preprint2020arXivOpen access

Abstract

Given a graph GG and a constant γ∈[0,1]γ\in [0,1], let ω(γ)(G)ω^{(γ)}(G) be the largest integer rr such that there exists an rr-vertex subgraph of GG containing at least γ(r2)γ\binom{r}{2} edges. It was recently shown that ω(γ)(G)ω^{(γ)}(G) is highly concentrated when GG is an Erdős-Rényi random graph (Balister, Bollobás, Sahasrabudhe, Veremyev, 2019). This paper provides a simple method to extend that result to a setting of inhomogeneous random graphs, showing that ω(γ)(G)ω^{(γ)}(G) remains concentrated on a small range of values even if GG is an inhomogeneous random graph. Furthermore, we give an explicit expression for ω(γ)(G)ω^{(γ)}(G) and show that it depends primarily on the largest edge probability of the graph GG.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.