3 citations · 6 across the 26 of their papers we have counts for
4 papers · 1 filter
Long induced cycles in pseudorandom graphs
Sahar Diskin, Lyuben Lichev, Michael Krivelevich +1
We show that, for some absolute constants , every -graph with contains an induced cycle of length at least . This is best possible…
The Mihail-Vazirani conjecture and strong edge-expansion in random polytopes
Micha Christoph, Sahar Diskin, Lyuben Lichev +1
We study the edge-expansion of the graph of a random polytope , defined as the convex hull of a random subset of the points in where every point is retaine…
Supercritical Site Percolation on Regular Graphs
Sahar Diskin, Michael Krivelevich, Itay Markbreit
We consider site (vertex) percolation on -regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergen…
Supercritical sharpness of percolation
Sahar Diskin, Philip Easo, Ritvik Ramanan Radhakrishnan +2
We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least decays exponentiall…