Abstract
Given a graph and a constant , let be the largest integer such that there exists an -vertex subgraph of containing at least edges. It was recently shown that is highly concentrated when 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 remains concentrated on a small range of values even if is an inhomogeneous random graph. Furthermore, we give an explicit expression for and show that it depends primarily on the largest edge probability of the graph .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.