Sahar Diskin

On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs, Electronic Journal of Combinatorics 29(3), P3.64 (2022)
(with Michael Krivelevich)

Site Percolation on Pseudo-Random Graphs, Random Structures & Algorithms 63(2), 406-441 (2023)
(with Michael Krivelevich)

Supercritical Site Percolation on the Hypercube: Small Components are Small, Combinatorics, Probability and Computing 32(3), 422-427 (2023)
(with Michael Krivelevich)

Heavy and Light Paths and Hamilton Cycles, Information Processing Letters 182 (2023)
(with Dor Elboim)

On Vertex Ramsey Graphs with Forbidden Subgraph, Discrete Mathematics 347(3) (2024)
(with Ilay Hoshen, Michael Krivelevich, and Maksim  Zhukovskii)

Percolation on Irregular High-dimensional Product Graphs, Combinatorics, Probability and Computing 33(3), 377-403 (2024)
(with Joshua Erde, Mihyun Kang, and Michael Krivelevich)

Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs, Combinatorica 44(4), 741-784 (2024)
(with Joshua Erde, Mihyun Kang, and Michael Krivelevich)

Expansion in Supercritical Random Subgraphs of Expanders and its Consequences, Random Structures & Algorithms 65(3), 576-600 (2024)
(with Michael Krivelevich)

Climbing up a random subgraph of the hypercube, Electronic Communications in Probability 29, paper no. 70, 1-13 (2024)
(with Michael Anastos, Dor Elboim, and Michael Krivelevich)

Percolation on High-dimensional Product Graphs, Random Structures & Algorithms 66(1), e21268 (2025)
(with Joshua Erde, Mihyun Kang, and Michael Krivelevich)

Long cycles in percolated expanders, Electronic Journal of Combinatorics 32(1), P1.8 (2025)
(with Maurício Collares, Joshua Erde, and Michael Krivelevich)

Minimum degree k and k-connectedness usually arrive together, Discrete Mathematics 348(6) (2025)
(with Anna Geisler)

A Jump of the Saturation Number in Random Graphs?, Random Structures & Algorithms 66(4), e70009 (2025)
(with Ilay Hoshen and Maksim  Zhukovskii)

Components, large and small, as they should be II: supercritical percolation on regular graphs of constant degree , International Mathematics Research Notices (IMRN) 12, rnaf167 (2025)
(with Michael Krivelevich)

Tree tilings in random regular graphs, Extended abstract version in LIPIcs 334, ICALP (2025)
(with Ilay Hoshen and Maksim  Zhukovskii)

Isoperimetry in product graphs, Electronic Journal of Combinatorics 32(3), P3.12 (2025)
(with Wojciech Samtoij)

Percolation through Isoperimetry, accepted to Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques, arXiv version
(with Joshua Erde, Mihyun Kang, and Michael Krivelevich)

Saturation in Random Hypergraphs, accepted to Combinatorics, Probability and Computing, arXiv version
(with Ilay Hoshen, Daniel Korandi, Benny Sudakov, and Maksim Zhukovskii)

Hitting time of connectedness in the random hypercube process, arXiv version
(with Michael Krivelevich)

Perfect matching in product graphs and their random subgraphs, submitted, arXiv version
(with Anna Geisler)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs, submitted, arXiv version
(with Joshua Erde, Mihyun Kang, and Michael Krivelevich)

Components, large and small, as they should be I: supercritical percolation on regular graphs of growing degree, submitted, arXiv version
(with Michael Krivelevich)

Universality of the matching number in percolated regular graphs, arxiv version
(with Mihyun Kang and Lyuben Lichev)

Nearly spanning cycle in the percolated hypercube, submitted, arxiv version
(with Michael Anastos, Joshua Erde, Mihyun Kang, Michael Krivelevich, and Lyuben Lichev)

Spanning trees of bounded degree in random geometric graphs, submitted, arxiv version
(with Michael Anastos, Dawid Ignasiak, Lyuben Lichev, and Yetong Sha)

A large hole in pseudo-random graphs, submitted, arxiv version
(with Michael Krivelevich, Itay Markbreit, and Maksim Zhukovskii)

Cycle lengths in the percolated hypercube, submitted, arxiv version
(with Michael Anastos, Joshua Erde, Mihyun Kang, Michael Krivelevich, and Lyuben Lichev)