On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs. - Sahar Diskin; Michael Krivelevich (Electron. J. Comb., 2022)

Supercritical site percolation on the hypercube: small components are small. - Sahar Diskin; Michael Krivelevich (Comb. Probab. Comput., 2023)

Heavy and light paths and Hamilton cycles. - Sahar Diskin; Dor Elboim (Inf. Process. Lett., 2023)

Site percolation on pseudo-random graphs. - Sahar Diskin; Michael Krivelevich (Random Struct. Algorithms, 2023)

Percolation on irregular high-dimensional product graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb. Probab. Comput., 2024)

Expansion in supercritical random subgraphs of expanders and its consequences. - Sahar Diskin; Michael Krivelevich (Random Struct. Algorithms, 2024)

On vertex Ramsey graphs with forbidden subgraphs. - Sahar Diskin; Ilay Hoshen; Michael Krivelevich; Maksim Zhukovskii (Discret. Math., 2024)

Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Comb., 2024)

Tiling Random Regular Graphs Efficiently. - Sahar Diskin; Ilay Hoshen; Maksim Zhukovskii (ICALP, 2025)

Long Cycles in Percolated Expanders. - Maurício Collares; Sahar Diskin; Joshua Erde; Michael Krivelevich (Electron. J. Comb., 2025)

Isoperimetry in Product Graphs. - Sahar Diskin; Wojciech Samotij (Electron. J. Comb., 2025)

Minimum degree k and k-connectedness usually arrive together. - Sahar Diskin; Anna Geisler (Discret. Math., 2025)

A Jump of the Saturation Number in Random Graphs? - Sahar Diskin; Ilay Hoshen; Maksim Zhukovskii (Random Struct. Algorithms, 2025)

Percolation on High-Dimensional Product Graphs. - Sahar Diskin; Joshua Erde; Mihyun Kang; Michael Krivelevich (Random Struct. Algorithms, 2025)