3 citations · 6 across the 26 of their papers we have counts for
6 papers · 1 filter
On vertex Ramsey graphs with forbidden subgraphs
Sahar Diskin, Ilay Hoshen, Michael Krivelevich +1
A classical vertex Ramsey result due to Nešetřil and Rödl states that given a finite family of graphs , a graph and a positive integer , if every graph $B\in\ma…
Percolation on Irregular High-dimensional Product Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We consider bond percolation on high-dimensional product graphs , where denotes the Cartesian product. We call the the base graphs and…
Heavy and Light Paths and Hamilton Cycles
Sahar Diskin, Dor Elboim
Given a graph , we denote by the number of paths of length in starting from . In graphs of maximum degree 3, with edge weights with ,…
Percolation on High-dimensional Product Graphs
Sahar Diskin, Joshua Erde, Mihyun Kang +1
We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest co…
Expansion in Supercritical Random Subgraphs of Expanders and its Consequences
Sahar Diskin, Michael Krivelevich
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the…
Supercritical Site Percolation on the Hypercube: Small Components are Small
Sahar Diskin, Michael Krivelevich
We consider supercritical site percolation on the -dimensional hypercube . We show that typically all components in the percolated hypercube, besides the giant, are of size…