Follow
Sahar Diskin
Sahar Diskin
PhD Student, Tel Aviv University
Verified email at mail.tau.ac.il
Title
Cited by
Cited by
Year
Percolation on High‐Dimensional Product Graphs
S Diskin, J Erde, M Kang, M Krivelevich
Random Structures & Algorithms 66 (1), e21268, 2025
112025
Percolation on irregular high-dimensional product graphs
S Diskin, J Erde, M Kang, M Krivelevich
Combinatorics, Probability and Computing 33 (3), 377-403, 2024
72024
Isoperimetric inequalities and supercritical percolation on high-dimensional graphs
S Diskin, J Erde, M Kang, M Krivelevich
Combinatorica, 1-44, 2024
7*2024
Site percolation on pseudo‐random graphs
S Diskin, M Krivelevich
Random Structures & Algorithms 63 (2), 406-441, 2023
72023
On the performance of the Depth First Search algorithm in supercritical random graphs
S Diskin, M Krivelevich
The Electronic Journal of Combinatorics, P3. 64-P3. 64, 2022, 2022
5*2022
Expansion in supercritical random subgraphs of expanders and its consequences
S Diskin, M Krivelevich
Random Structures & Algorithms 65 (3), 576-600, 2024
4*2024
Percolation through isoperimetry
S Diskin, J Erde, M Kang, M Krivelevich
arXiv preprint arXiv:2308.10267, 2023
42023
Perfect Matching in Product Graphs and in their Random Subgraphs
S Diskin, A Geisler
arXiv preprint arXiv:2404.14020, 2024
32024
Supercritical site percolation on the hypercube: small components are small
S Diskin, M Krivelevich
Combinatorics, Probability and Computing 32 (3), 422-427, 2023
32023
On vertex Ramsey graphs with forbidden subgraphs
S Diskin, I Hoshen, M Krivelevich, M Zhukovskii
Discrete Mathematics 347 (3), 113806, 2024
22024
A Jump of the Saturation Number in Random Graphs?
S Diskin, I Hoshen, M Zhukovskii
arXiv preprint arXiv:2303.12046, 2023
22023
Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
S Diskin, M Krivelevich
arXiv preprint arXiv:2408.04597, 2024
12024
Isoperimetry in product graphs
S Diskin, W Samotij
arXiv preprint arXiv:2407.02058, 2024
12024
Saturation in Random Hypergraphs
S Diskin, I Hoshen, D Korándi, B Sudakov, M Zhukovskii
arXiv preprint arXiv:2405.03061, 2024
12024
Hitting time of connectedness in the random hypercube process
S Diskin, M Krivelevich
arXiv preprint arXiv:2404.09289, 2024
12024
Tree tilings in random regular graphs
S Diskin, I Hoshen, M Zhukovskii
arXiv preprint arXiv:2412.19756, 2024
2024
Minimum degree k and k-connectedness usually arrive together
A Geisler, S Diskin
2024
Minimum degree and -connectedness usually arrive together
S Diskin, A Geisler
arXiv preprint arXiv:2409.14398, 2024
2024
Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
S Diskin, M Krivelevich
arXiv preprint arXiv:2408.04599, 2024
2024
Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
S Diskin, J Erde, M Kang, M Krivelevich
arXiv preprint arXiv:2407.16458, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20