4 citations · 21 across the 45 of their papers we have counts for
4 papers · 1 filter
Long induced cycles in pseudorandom graphs
Sahar Diskin, Lyuben Lichev, Michael Krivelevich +1
We show that, for some absolute constants , every -graph with contains an induced cycle of length at least . This is best possible…
Universality in random graphs via optimal linking systems: trees and beyond
Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii
We develop a framework for proving universality results in sparse random graphs. As a first application, we show that there exists an absolute constant such that, with high p…
The Mihail-Vazirani conjecture and strong edge-expansion in random polytopes
Micha Christoph, Sahar Diskin, Lyuben Lichev +1
We study the edge-expansion of the graph of a random polytope , defined as the convex hull of a random subset of the points in where every point is retaine…
On the depth of depth-weighted trees
Lyuben Lichev, Amitai Linker, Bas Lodewijks +1
The depth-weighted tree DWT() with weight function is a dynamic random tree grown from a root where vertices arrive consecutively and ever…