3 citations · 6 across the 26 of their papers we have counts for
Showing 2023 · math.COShow all
3 papers · 2 filters
math.CO2023
Climbing up a random subgraph of the hypercube
Michael Anastos, Sahar Diskin, Dor Elboim +1
Let be the -dimensional binary hypercube. We say that is an increasing path of length in , if for every the edge $v_iv_{i+1…
math.CO2023
Percolation through Isoperimetry
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We provide a sufficient condition on the isoperimetric properties of a regular graph of growing degree , under which the random subgraph typically undergoes a phase tr…
math.CO2023
A Jump of the Saturation Number in Random Graphs?
Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii
For graphs and , the saturation number is the minimum number of edges in an inclusion-maximal -free subgraph of . In 2017, Korándi and Sudakov init…