Sahar Diskin

activity

20242026

collaborators

Showing math.COShow all

16 papers · 1 filter

math.CO2026

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes

Micha Christoph, Sahar Diskin, Lyuben Lichev +1

We study the edge-expansion of the graph of a random $0/1$ polytope $P_{p}^{d}$ , defined as the convex hull of a random subset of the points in ${0, 1}^{d}$ where every point is retaine…

math.CO2026

Supercritical Site Percolation on Regular Graphs

Sahar Diskin, Michael Krivelevich, Itay Markbreit

We consider site (vertex) percolation on $d$ -regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergen…

math.CO2025

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

Sahar Diskin, Michael Krivelevich

We provide sufficient conditions for a regular graph $G$ of growing degree $d$ , guaranteeing a phase transition in its random subgraph $G_{p}$ similar to that of $G (n, p)$ when $p\cdo…

math.CO2025

Saturation in Random Hypergraphs

Sahar Diskin, Ilay Hoshen, DÃ¡niel KorÃ¡ndi +2

Let $K_{n}^{r}$ be the complete $r$ -uniform hypergraph on $n$ vertices, that is, the hypergraph whose vertex set is $[n] := {1, 2, ..., n}$ and whose edge set is $(r [ n ])$ . We form…

math.CO2025

Perfect Matching in Product Graphs and in their Random Subgraphs

Sahar Diskin, Anna Geisler

For $t \in N$ and every $i \in [t]$ , let $H_{i}$ be a $d_{i}$ -regular connected graph, with $1 < ∣ V (H_{i}) ∣ \leq C$ for some integer $C \geq 2$ . Let $G = □_{i = 1}^{t} H_{i}$ be the Cartes…

math.CO2025

Cycle lengths in the percolated hypercube

Michael Anastos, Sahar Diskin, Joshua Erde +3

Let $Q_{p}^{d}$ be the random subgraph of the $d$ -dimensional binary hypercube obtained after edge-percolation with probability $p$ . It was shown recently by the authors that, for ever…

The Mihail-Vazirani conjecture and strong edge-expansion in random 0/1 polytopes

Supercritical Site Percolation on Regular Graphs

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

Saturation in Random Hypergraphs

Perfect Matching in Product Graphs and in their Random Subgraphs

Cycle lengths in the percolated hypercube

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes