Combinatorial Properties of The Giant Under Supercritical Percolation

We study combinatorial properties, such as diameter and long paths and cycles, of the giant component of percolated graphs. Such combinatorial properties are well studied for classical graphs such as pseudo-random graphs and the hypercube. We aim to obtain similar results for extensive families of $d$-regular $n$-vertex graphs. Specifically, assuming expansion properties of the host graph, we show a typical vertex expansion by a factor of $1/d\log d$ in the giant component of the percolated subgraph. As a consequence, we obtain bounds on various combinatorial properties of the giant component. For example, a bound of $O\left(d\log^2 d+\log n\right)$ on the typical diameter of the giant component of the percolated subgraph. In addition, we construct graphs with very good vertex and edge expansion, but having large diameter, showing that the diameter of the percolated subgraph is not necessarily typically logarithmic in the number of the vertices of the graph. We also present good expanders such that their percolated subgraph typically contains a bad expanding set.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24606
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Combinatorial Properties of The Giant Under Supercritical Percolation

Michael Krivelevich, Sahar Diskin, Itay Markbreit, Mihyun Kang
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Combinatorial Properties of The Giant Under Supercritical Percolation

Michael Krivelevich, Sahar Diskin, Itay Markbreit, Mihyun Kang
preprint en

Abstract

We study combinatorial properties, such as diameter and long paths and cycles, of the giant component of percolated graphs. Such combinatorial properties are well studied for classical graphs such as pseudo-random graphs and the hypercube. We aim to obtain similar results for extensive families of $d$-regular $n$-vertex graphs. Specifically, assuming expansion properties of the host graph, we show a typical vertex expansion by a factor of $1/d\log d$ in the giant component of the percolated subgraph. As a consequence, we obtain bounds on various combinatorial properties of the giant component. For example, a bound of $O\left(d\log^2 d+\log n\right)$ on the typical diameter of the giant component of the percolated subgraph. In addition, we construct graphs with very good vertex and edge expansion, but having large diameter, showing that the diameter of the percolated subgraph is not necessarily typically logarithmic in the number of the vertices of the graph. We also present good expanders such that their percolated subgraph typically contains a bad expanding set.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon