Sahar Diskin

most citedExpansion in Supercritical Random Subgraphs of Expanders and its Consequences

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

Minimum degree $k$ and $k$ -connectedness usually arrive together

Sahar Diskin, Anna Geisler

Let $d, n \in N$ be such that $d = ω (1)$ , and $d \leq n^{1 - a}$ for some constant $a > 0$ . Consider a $d$ -regular graph $G = (V, E)$ and the random graph process that starts with the…

math.CO2024

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree

Sahar Diskin, Michael Krivelevich

Let $d \geq 3$ be a fixed integer. Let $y := y (p)$ be the probability that the root of an infinite $d$ -regular tree belongs to an infinite cluster after $p$ -bond-percolation. We show…

math.CO2022★ 1 cited

Expansion in Supercritical Random Subgraphs of Expanders and its Consequences

Sahar Diskin, Michael Krivelevich

In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the…

Minimum degree k and k-connectedness usually arrive together

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree

Expansion in Supercritical Random Subgraphs of Expanders and its Consequences

Minimum degree $k$ and $k$ -connectedness usually arrive together