2 papers
math.CO2024
Long cycles in percolated expanders
Maurício Collares, Sahar Diskin, Joshua Erde +1
Given a graph and probability , we form the random subgraph by retaining each edge of independently with probability . Given and constants $0<c…
math.PR2024
Hitting time of connectedness in the random hypercube process
Sahar Diskin, Michael Krivelevich
We present a short and self-contained proof of a classical result due to Bollobás (1990): in the random hypercube process, with high probability the hitting time of connectedness e…